Packet buffering: Randomization beats deterministic algorithms

Lecture Notes in Computer Science

Volumn 3404, Issue , 2005, Pages 293-304

  Schmidt, Markus ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA HANDLING; ONLINE SYSTEMS; PACKET NETWORKS; SWITCHES;

DETERMINISTIC ALGORITHMS; NETWORK SWITCHES; PACKET BUFFERING; RANDOMIZATION;

RANDOM PROCESSES;

EID: 24144439994     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31856-9_24     Document Type: Conference Paper

References (15)

1. W. Aiello, Y. Mansour, S. Rajagopolan and A. Rośen, Competitive queue policies for differentiated services. Proc. INFOCOM, 431-440, 2000.
2. S. Albers and M. Schmidt. On the performance of greedy algorithms in packet buffering. Proc. 36th ACM Symposium on Theory of Computing, 35-44, 2004.
3. N. Andelman, Y. Mansour and A. Zhu. Competitive queueing policies in QoS switches. Proc. 14th ACM-SIAM Symposium on Discrete Algorithms, 761-770, 2003.
4. Y. Azar and Y. Richter. Management of multi-queue switches in QoS Networks. Proc. 35th ACM Symposium on Theory of Computing, 82-89, 2003.
5. Y. Azar and Y. Richter. The zero-one principle for switching networks. Proc. 36th ACM Symposium on Theory of Computing, 64-71, 2004.
6. A. Aziz, A. Prakash and V. Ramachandran. A new optimal scheduler for switchmemory-switch routers. Proc. 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures 343- 352, 2003.
7. N. Bansal, L.K. Fleischer, T. Kimbrel, M. Mahdian, B. Schieber and M. Sviridenko. Further Improvements in Competitive Guarantees for QoS Buffering. Proc. 31st International Colloquium on Automata, Languages and Programming, Springer LNCS, Volume 3142, 196 - 207, 2004.
8. A. Bar-Noy, A. Freund, S. Landa and J. Naor. Competitive on-line switching policies. Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, 525-534, 2002.
9. E.L. Hahne, A. Kesselman and Y. Mansour. Competitive buffer management for shared-memory switches. Proc. 13th ACM Symposium on Parallel Algorithms and Architectures, 53-58, 2001.
10. A. Kesselman, Z. Lotker, Y. Mansour, B. Patt-Shamir, B. Schieber and M. Sviridenko. Buffer overflow management in QoS switches. Proc. 31st ACM Symposium on Theory of Computing, 520-529, 2001.
11. A. Kesselman and Y. Mansour. Loss-bounded analysis for differentiated services. Proc. 12th ACM-SIAM Symposium on Discrete Algorithms, 591-600, 2001.
12. A. Kesselman, Y. Mansour and R. van Stee. Improved competitive guarantees for QoS buffering Proc. 11th European Symposium on Algorithms, Springer LNCS, Volume 2832, 361-372, 2003.
13. A. Kesselman and A. Rosén. Scheduling policies for CIOQ switches. Proc. 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 353-361, 2003.
14. H. Koga. Balanced scheduling towards loss-free packet queueing and delay fairness. Proc. 12th Annual International Symposium on Algorithms and Computation, 61-73, 2001.
15. D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202-208, 1985.