On the performance of greedy algorithms in packet buffering

DOI10.1145/1007352.1007366zbMath1192.68938OpenAlexW2009303716MaRDI 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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Randomized algorithms (68W20)

Related Items (4)

Maximizing throughput in multi-queue switches ⋮ Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers ⋮ Resource Management in Large Networks ⋮ Buffer management of multi-queue QoS switches with class segregation

This page was built for publication: On the performance of greedy algorithms in packet buffering