Maximizing throughput in multi-queue switches

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

Volumn 3221, Issue , 2004, Pages 53-64

  Azar, Yossi ^a   Litichevskey, Arik ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; TELECOMMUNICATION NETWORKS;

ARRIVAL RATES; BOUNDED CAPACITIES; COMPETITIVE RATIO; LIMITED CAPACITY; MULTI-QUEUE SWITCH; PACKET STREAMS; SCENARIO MODELS; TRANSMISSION RATES;

QUEUEING THEORY;

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

References (15)

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, 2000.
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.
3. N. Andelman, Y. Mansour, and A. Zhu. Competitive queueing policies for QoS switches. In Proc. 13rd ACM-SIAM Symp. on Discrete Algorithms, pages 761-770, 2003.
4. 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.
5. Y. Azar and Y. Richter. The zero-one principle for switching networks. In Proc. 36th ACM Symp. on Theory of Computing, 2004.
6. A. Bar-Noy, A. Freund, S. Landa, and J. Naor. Competitive on-line switching policies. In Proc. 13rd ACM-SIAM Symp. on Discrete Algorithms, pages 525-534, 2002.
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. 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.
9. B. Kalyanasundaram and K. R. Pruhs. An optimal deterministic algorithm for online b-matching. Theoretical Computer Science, 233:319-325, 2000.
10. 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.
11. 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.
12. A. Kesselman and Y. Mansour. Loss-bounded analysis for differentiated services. In Proc. 12nd ACM-SIAM Symp. on Discrete Algorithms, pages 591-600, 2001.
13. 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.
14. 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.
15. 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, 1999.