On the performance of greedy algorithms in packet buffering
From MaRDI portal
Publication:3580957
DOI10.1145/1007352.1007366zbMath1192.68938MaRDI QIDQ3580957
Markus Schmidt, Susanne Albers
Publication date: 15 August 2010
Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1007352.1007366
68W40: Analysis of algorithms
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68W20: Randomized algorithms
Related Items
Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers, Buffer management of multi-queue QoS switches with class segregation, Maximizing throughput in multi-queue switches, Resource Management in Large Networks