One to Rule Them All: A General Randomized Algorithm for Buffer Management with Bounded Delay

DOI10.1007/978-3-642-23719-5_21zbMath1308.68151OpenAlexW2115380243MaRDI QIDQ3092233

Łukasz Jeż

Publication date: 16 September 2011

Published in: Algorithms – ESA 2011 (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.745.3468

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Randomized algorithms (68W20)

Related Items (2)

Collecting weighted items from a dynamic queue ⋮ An optimal lower bound for buffer management in multi-queue switches

This page was built for publication: One to Rule Them All: A General Randomized Algorithm for Buffer Management with Bounded Delay