On the performance of greedy algorithms in packet buffering

SIAM Journal on Computing

Volumn 35, Issue 2, 2006, Pages 278-304

  Albers, Susanne ^a   Schmidt, Markus ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Buffer; Competitive; Greedy; Network switch; Online; Packet; Throughput

Indexed keywords

ALGORITHMS; ONLINE SYSTEMS; OPTIMIZATION; SWITCHES; THROUGHPUT;

BUFFER; COMPETITIVE; NETWORK SWITCH; ONLINE;

PACKET NETWORKS;

EID: 33645753308     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539704446268     Document Type: Article

References (17)

1. W. AIELLO, Y. MANSOUR, S. RAJAGOPOLAN, AND A. ROSÉN, Competitive queue policies for differentiated services, J. Algorithms, 55 (2005), pp. 113-141.
2. N. ANDELMAN, Y. MANSOUR, AND A. ZHU, Competitive queueing policies for QoS switches, in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, ACM, New York, 2003, pp. 761-770.
3. Y. AZAR AND A. LITICHESKEY, Maximizing throughput in multi-queue switches, in Proceedings of the 12th Annual European Symposium on Algorithms, Lecture Notes in Comput. Sci. 3221, Springer, Berlin, New York, 2004, pp. 53-64.
4. Y. AZAR AND Y. RICHTER, Management of multi-queue switches in QoS networks, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, ACM, New York, 2003, pp. 82-89.
5. Y. AZAR AND Y. RICHTER, The zero-one principle for switching networks, in Proceedings of the 36th ACM Symposium on Theory of Computing, ACM, New York, 2004, pp. 64-71.
6. Y. AZAR AND Y. RICHTER, An improved algorithm for CIOQ switches, in Proceedings of the 12th Annual European Symposium on Algorithms, Lecture Notes in Comput. Sci. 3221, Springer, Berlin, New York, 2004, pp. 65-76.
7. A. AZIZ, A. PRAKASH, AND V. RAMACHANDRAN, A new optimal scheduler for switch-memory-switch routers, in Proceedings of the 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures, ACM, New York, 2003, pp. 343-352.
8. N. BANSAL, L. K. FLEISCHER, T. KIMBREL, M. MAHDIAN, B. SCHIEBER, AND M. SVIRIDENKO, Further improvements in competitive guarantees for QoS buffering, in Proceedings of the 31st International Colloquium on Automata, Languages, and Programming, Lecture Notes in Comput. Sci. 3142, Springer, Berlin, New York, 2004, pp. 196-207.
9. A. BAR-NOY, A. FREUND, S. LANDA, AND J. NAOR, Competitive on-line switching policies, Algorithmica, 36 (2003), pp. 225-247.
10. R. FLEISCHER AND H. KOGA, Balanced scheduling toward loss-free packet queuing and delay fairness, Algorithmica, 38 (2004), pp. 363-376.
11. E. L. HAHNE, A. KESSELMAN, AND Y. MANSOUR, Competitive buffer management for shared-memory switches, in Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, ACM, New York, 2001, pp. 53-58.
12. A. KESSELMAN, Z. LOTKER, Y. MANSOUR, B. PATT-SHAMIR, B. SCHIEBER, AND M. SVIRIDENKO, Buffer overflow management in QoS switches, SIAM J. Comput., 33 (2004), pp. 563-583.
13. A. KESSELMAN AND Y. MANSOUR, Loss-bounded analysis for differentiated services, J. Algorithms, 46 (2003), pp. 79-95.
14. A. KESSELMAN, Y. MANSOUR, AND R. VAN STEE, Improved competitive guarantees for QoS buffering, in Proceedings of the 11th Annual European Symposium on Algorithms, Lecture Notes in Comput. Sci. 2832, Springer, Berlin, 2003, pp. 361-372.
15. A. KESSELMAN AND A. ROSÉN, Scheduling policies for CIOQ switches, in Proceedings of the 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures, ACM, New York, 2003, pp. 353-361.
16. M. SCHMIDT, Packet buffering: Randomization beats deterministic algorithms, in Proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 3404, Springer, Berlin, 2005, pp. 293-304.
17. D. D. SLEATOR AND R. E. TARJAN, Amortized efficiency of list update and paging rules, Comm. ACM, 28 (1985), pp. 202-208.