Competitive management of non-preemptive queues with multiple values

DOI10.1007/B13831MaRDI QIDQ5897406zbMATH OpenOpenAlexFDO

Authors Nir Andelman, Yishay Mansour

Publication date 23 February 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13831

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• scientific article; zbMATH DE number 2079410
• Analysis of queueing policies in QoS switches
• Competitive queue policies for differentiated services
• Nearly optimal FIFO buffer management for two packet classes.
• Competitive analysis of constrained queueing systems

Cited in

(8)

• Comparison-based buffer management in QoS switches
• The loss of serving in the dark
• Optimal buffer management for 2-frame throughput maximization
• Tight Analysis of Priority Queuing for Egress Traffic
• Better bounds for online \(k\)-frame throughput maximization in network switches
• An optimal lower bound for buffer management in multi-queue switches
• Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms
• Buffer management for colored packets with deadlines

This page was built for publication: Competitive management of non-preemptive queues with multiple values

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