Skip to main content
SpringerLink
Log in

Maximizing throughput in multi-queue switches

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We study a basic problem in Multi-Queue switches. A switch connectsm input ports to a single output port. Each input port is equipped with an incoming FIFO queue with bounded capacityB. A switch serves its input queues by transmitting packets arriving at these queues, one packet per time unit. Since the arrival rate can be higher than the transmission rate and each queue has limited capacity, packet loss may occur as a result of insufficient queue space. The goal is to maximize the number of transmitted packets. This general scenario models most current networks (e.g. IP networks) which only support a “best effort” service in which all packet streams are treated equally. A 2-competitive algorithm for this problem was designed in [5] for arbitraryB. Recently, a (17/9 ≈ 1.89)-competitive algorithm was presented forB>1 in [3]. Our main result in this paper shows that forB which is not too small our algorithm can do better than 1.89, and approach a competitive ratio ofe/(e − 1) ≈ 1.58.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. Adler, P. Berenbrink, T. Friedetzky, L. Goldberg, and M. Paterson. A proportionate fair scheduling rule with good worst-case performance. InProc. 15th Ann. ACM Symp. on Parallel Algorithms and Architectures, pages 101–108, 2003.

  2. W. A. Aiello, Y. Mansour, S. Rajagopolan, and A. Rosen. Competitive queue policies for differentiated services. InProc. IEEE INFOCOM 2000, pages 431–440, 2000.

  3. S. Albers and M. Schmidt. On the performance of greedy algorithms in packet buffering. InProc. 36th ACM Symp. on Theory of Computing, pages 35–44, 2004.

  4. N. Andelman, Y. Mansour, and A. Zhu. Competitive queueing policies for QoS switches. InProc. 13th ACM-SIAM Symp. on Discrete Algorithms, pages 761–770, 2003.

  5. Y. Azar and Y. Richter. Management of multi-queue switches in QoS networks. InProc. 35th ACM Symp. on Theory of Computing, pages 82–89, 2003.

  6. Y. Azar and Y. Richter. The zero-one principle for switching networks. InProc. 36th ACM Symp. on Theory of Computing, 2004.

  7. A. Bar-Noy, A. Freund, S. Landa, and J. Naor. Competitive on-line switching policies. InProc. 13th ACM-SIAM Symp. on Discrete Algorithms, pages 525–534, 2002.

  8. A. Birman, H. R. Gail, S. L. Hantler, Z. Rosberg, and M. Sidi. An optimal service policy for buffer systems.Journal of the Association for Computing Machinery, 42(3):641–657, 1995.

    MATH  MathSciNet  Google Scholar 

  9. M. Chrobak, J. Csirik, C. Imreh, J. Noga, J. Sgall, and G. J. Woeginger. The buffer minimization problem for multiprocessor scheduling with conflicts. InProc. 28th Internat. Colloq. on Automata, Languages, and Programming, pages 862–874, 2001.

  10. B. Kalyanasundaram and K. R. Pruhs. An optimal deterministic algorithm for online b-matching.Theoretical Computer Science, 233:319–325, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  11. R. Karp, U. Vazirani, and V. Vazirani. An optimal algorithm for on-line bipartite matching. InProc. 22nd Ann. ACM Symp. on Theory of Computing, pages 352–358, May 1990.

  12. A. Kesselman, Z. Lotker, Y. Mansour, B. Patt-Shamir, B. Schieber, and M. Sviridenko. Buffer overflow management in QoS switches. InProc. 33rd ACM Symp. on Theory of Computing, pages 520–529, 2001.

  13. A. Kesselman and Y. Mansour. Loss-bounded analysis for differentiated services. InProc. 12th ACM-SIAM Symp. on Discrete Algorithms, pages 591–600, 2001.

  14. H. Koga. Balanced scheduling toward loss-free packet queuing and delay fairness. InProc. 12th Ann. Internat. Symp. on Algorithms and Computation, pages 61–73, 2001.

  15. Z. Lotker and B. Patt-Shamir. Nearly optimal fifo buffer management for diffserv. InProc. 21st ACM Symp. on Principles of Distributed Computing, pages 134–143, 2002.

  16. M. May, J. C. Bolot, A. Jean-Marie, and C. Diot. Simple performance models of differentiated services for the internet. InProc. IEEE INFOCOM 1999, pages 1385–1394, 1999.

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Tel-Aviv University, 69978, Tel-Aviv, Israel

    Yossi Azar & Arik Litichevskey

Authors
  1. Yossi Azar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arik Litichevskey
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yossi Azar.

Additional information

The research of Yossi Azar was supported in part by the Israeli Ministry of Industry and Trade and by the Israel Science Foundation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Azar, Y., Litichevskey, A. Maximizing throughput in multi-queue switches. Algorithmica 45, 69–90 (2006). https://doi.org/10.1007/s00453-005-1190-x

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-005-1190-x

Key Words

Search

Navigation