Randomized Algorithms for Buffer Management with 2-Bounded Delay

DOI10.1007/978-3-540-93980-1_8zbMath1209.68625OpenAlexW1540747310MaRDI QIDQ3602832

Marcin Bienkowski, Łukasz Jeż, Marek Chrobak

Publication date: 12 February 2009

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-93980-1_8

Mathematics Subject Classification ID

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

Related Items

Comparison-based buffer management in QoS switches

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the power of randomization in on-line algorithms
• Online scheduling with partial job values: does timesharing or randomization help?
• Online competitive algorithms for maximizing weighted throughput of unit jobs
• Buffer Overflow Management in QoS Switches
• Algorithms – ESA 2004