On the performance of greedy algorithms in packet buffering
DOI10.1145/1007352.1007366zbMATH Open1192.68938OpenAlexW2009303716MaRDI QIDQ3580957FDOQ3580957
Authors: Susanne Albers, Markus Schmidt 
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
Recommendations
Randomized algorithms (68W20) Analysis of algorithms (68W40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cited In (17)
- Resource Management in Large Networks
- An Experimental Study of New and Known Online Packet Buffering Algorithms
- Buffer management of multi-queue QoS switches with class segregation
- Rate vs. buffer size -- greedy information gathering on the line
- Competitive buffer management for shared-memory switches
- Maximizing throughput in multi-queue switches
- Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers
- Overflow management with self-eliminations
- Overflow management with self-eliminations
- STACS 2005
- Optimal buffer management for 2-frame throughput maximization
- Performance of packet discard polices
- On the Performance of Greedy Algorithms in Packet Buffering
- An optimal lower bound for buffer management in multi-queue switches
- An experimental study of new and known online packet buffering algorithms
- An optimal lower bound for buffer management in multi-queue switches
- Packet delay caused by stack-algorithm for overcritical income flow
This page was built for publication: On the performance of greedy algorithms in packet buffering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580957)
