An improved algorithm for CIOQ switches

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3221, Issue , 2004, Pages 65-76

  Azar, Yossi ^a   Richter, Yossi ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

Q SWITCHING; SCHEDULING;

COMBINED INPUT AND OUTPUT QUEUED; COMPETITIVE ALGORITHMS; COMPETITIVE ANALYSIS; COMPETITIVE RATIO; INPUT AND OUTPUTS; ON-LINE ALGORITHMS; SCHEDULING POLICIES; SWITCH ARCHITECTURES;

ALGORITHMS;

EID: 32144452323     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30140-0_8     Document Type: Article

References (14)

1. W. A. Aiello, Y. Mansour, S. Rajagopolan, and A. Rosén. Competitive queue policies for differentiated services. In Proceedings of the IEEE INFOCOM 2000, pages 431-440.
2. S. Albers and M. Schmidt. On the performance of greedy algorithms in packet buffering. In Proc. 36th ACM Symp. on Theory of Computing, 2004. To appear.
3. N. Andelman, Y. Mansour, and A. Zhu. Competitive queueing policies for QoS switches. In Proc. 14th ACM-SIAM Symp. on Discrete Algorithms, pages 761-770, 2003.
4. M. Andrews, B. Awerbuch, A. Fernández, J. Kleinberg, T. Leighton, and Z. Liu. Universal stability results for greedy contention-resolution protocols. In Proc. 37th IEEE Symp. on Found, of Corny. Science, pages 380-389, 1996.
5. Y. Azar and Y. Richter. Management of multi-queue switches in QoS networks. In Proc. 35th ACM Symp. on Theory of Computing, pages 82-89, 2003.
6. Y. Azar and Y. Richter. The zero-one principle for switching networks. In Proc. 36th ACM Symp. on Theory of Computing, 2004. To appear.
7. A. Birman, H. R. Gail, S. L. Hantier, Z. Rosberg, and M. Sidi. An optimal service policy for buffer systems. Journal of the Association Computing Machinery (JACM), 42(3):641-657, 1995.
8. A. Borodin, J.Kleinberg, P. Raghavan, M. Sudan, and D. Williamson. Adversarial queuing theory. In Proc. 28th ACM Symp. on Theory of Computing, pages 376-385, 1996.
9. 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, pages 53-58, 2001.
10. A. Kesselman, Z. Lotker, Y. Mansour, B. Patt-Shamir, B. Schieber, and M. Sviridenko. Buffer overflow management in QoS switches. In Proc. 33rd ACM Symp. on Theory of Computing, pages 520-529, 2001.
11. A. Kesselman and Y. Mansour. Loss-bounded analysis for differentiated services. In Proc. 12th ACM-SIAM Symp. on Discrete Algorithms, pages 591-600, 2001.
12. A. Kesselman and A. Rosén. Scheduling policies for CIOQ switches. In Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 353-362, 2003.
13. Z. Lotker and B. Patt-Shamir. Nearly optimal fifo buffer management for diffserv. In Proc. 21st ACM Symp. on Principles of Distrib. Computing, pages 134-143, 2002.
14. M. May, J. C. Bolot, A. Jean-Marie, and C. Diot. Simple performance models of differentiated services for the internet. In Proceedings of the IEEE INFOCOM 1999, pages 1385-1394.