Competitive analysis of constrained queueing systems

DOI10.4230/LIPICS.ICALP.2016.143zbMATH Open1388.68018OpenAlexW2530691253MaRDI QIDQ4598286FDOQ4598286

Authors Sungjin Im, Janardhan Kulkarni, Kamesh Munagala

Publication date 19 December 2017

Full work available at URL https://doi.org/10.4230/LIPIcs.ICALP.2016.143

zbMATH Keywords

online schedulingadversarialaverage flow timeswitch network

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• scientific article; zbMATH DE number 2119707
• Competitive on-Line switching policies
• Analysis of queueing policies in QoS switches
• Tight Analysis of Priority Queuing for Egress Traffic
• Algorithms – ESA 2004

Cited in

(3)

• scientific article; zbMATH DE number 2119707 (Why is no real title available?)
• Competitive management of non-preemptive queues with multiple values
• Competitive queue policies for differentiated services

This page was built for publication: Competitive analysis of constrained queueing systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598286)