STACS 2005
From MaRDI portal
Publication:5710683
DOI10.1007/b106485zbMath1118.68761OpenAlexW4230940848MaRDI QIDQ5710683
Publication date: 2 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106485
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20)
Related Items (8)
The loss of serving in the dark ⋮ 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 ⋮ An experimental study of new and known online packet buffering algorithms ⋮ Online packet scheduling for CIOQ and buffered crossbar switches ⋮ Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers ⋮ Resource Management in Large Networks
This page was built for publication: STACS 2005
