Management of multi-queue switches in QoS networks

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 82-89

  Azar, Yossi ^a   Richter, Yossi ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Competitive; On line; QoS; Switch

Indexed keywords

BANDWIDTH; QUALITY OF SERVICE; SWITCHING NETWORKS; TELECOMMUNICATION TRAFFIC;

MULTI-QUEUE SWITCHES;

QUEUEING NETWORKS;

EID: 0038447033     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780542.780556     Document Type: Conference Paper

References (13)

1. 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.
2. 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.
3. A. Bar-Noy, A. Freund, S. Landa, and J. Naor. Competitive on-line switching policies. In Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, pages 525-534, 2002.
4. 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.
5. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
6. M. Chrobak, J. Csirik, C. Imreh, J. Noga, J. Sgall, and G. J. Woeginger. The buffer minimization problem for multiprocessor scheduling with conflicts. In Proc. 28th International Colloquium on Automata, Languages, and Programming, pages 862-874, 2001.
7. 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.
8. R. Karp, U. Vazirani, and V. Vazirani. An optimal algorithm for on-line bipartite matching. In Proceedings of 22nd Annual ACM Symposium on Theory of Computing, pages 352-358, may 1990.
9. 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.
10. A. Kesselman and Y. Mansour. Loss-bounded analysis for differentiated services. In Proc. 12th ACM-SIAM Symp. on Discrete Algorithms, pages 591-600, 2001.
11. H. Koga. Balanced scheduling toward loss-free packet queuing and delay fairness. In Proc. 12th Annual International Symposium on Algorithms and Computation, pages 61-73, 2001.
12. 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.
13. 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.