The zero-one principle for switching networks

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 64-71

  Azar, Yossi ^a   Richter, Yossi ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Competitive; On line; QoS; Switch

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PROBLEM SOLVING; QUALITY OF SERVICE; QUEUEING THEORY; TELECOMMUNICATION NETWORKS; TOPOLOGY;

DYNAMIC ROUTING PROBLEMS; PACKET INJECTIONS; ROUTING WEIGHTED PACKETS; ZERO-ONE PRINCIPLES;

SWITCHING NETWORKS;

EID: 4544361672     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007369     Document Type: Conference Paper

References (17)

1. W. Aiello, R. Ostrovsky, E. Kushilevitz, and A. Rosén. Dynamic routing on networks with fixed-size buffers. In Proc. 14th ACM-SIAM Symp. on Discrete Algorithms, pages 771-780, 2003.
2. W. A. Aiello, Y. Mansour, S. Rajagopolan, and A. Rosen. Competitive queue policies for differentiated services. In Proceedings of the IEEE INFOCOM 2000, pages 431-440.
3. M. Ajtai, J. Komlós, and E. Szemerédi. An o(n log n) sorting network. In Proc. 15th ACM Symp. on Theory of Computing, pages 1-9, 1983.
4. 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.
5. 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 Comp. Science, pages 380-389, 1996.
6. 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.
7. A. Birman. H. R. Gail. S. L. Hantler, 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. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press, 1990.
10. 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.
11. A. Kesselman, Z. Lotker, Y. Mansour, and B. Patt-Shamir. Buffer overflows of merging streams. In Proc. 11th Annual European Symposium on Algorithms, pages 349-360, 2003.
12. 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.
13. A. Kesselman and Y. Mansour. Loss-bounded analysis for differentiated services. In Proc. 12th ACM-SIAM Symp. on Discrete Algorithms, pages 591-600, 2001.
14. 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.
15. Donald E. Knuth. The Art of Computer Programming, Sorting and Searching, volume 3. Addison-Wesley, Reading, MA, 1973.
16. 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.
17. 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.