Abstract
We study a basic problem in Multi-Queue switches. A switch connects m input ports to a single output port. Each input port is equipped with an incoming FIFO queue with bounded capacity B. 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 [4] for arbitrary B. Recently, a \(\frac{17}{9}\approx 1.89\)-competitive algorithm was presented for B>1 in [2]. Our main result in this paper shows that for B which is not too small our algorithm can do better than 1.89, and approach a competitive ratio of \(\frac{e}{e-1}\approx 1.58\).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aiello, W.A., Mansour, Y., Rajagopolan, S., Rosen, A.: Competitive queue policies for differentiated services. In: Proceedings of the IEEE INFOCOM 2000, pp. 431–440 (2000)
Albers, S., Schmidt, M.: On the performance of greedy algorithms in packet buffering. In: Proc. 36th ACM Symp. on Theory of Computing (2004)
Andelman, N., Mansour, Y., Zhu, A.: Competitive queueing policies for QoS switches. In: Proc. 13rd ACM-SIAM Symp. on Discrete Algorithms, pp. 761–770 (2003)
Azar, Y., Richter, Y.: Management of multi-queue switches in QoS networks. In: Proc. 35th ACM Symp. on Theory of Computing, pp. 82–89 (2003)
Azar, Y., Richter, Y.: The zero-one principle for switching networks. In: Proc. 36th ACM Symp. on Theory of Computing (2004)
Bar-Noy, A., Freund, A., Landa, S., Naor, J.: Competitive on-line switching policies. In: Proc. 13rd ACM-SIAM Symp. on Discrete Algorithms, pp. 525–534 (2002)
Birman, A., Gail, H.R., Hantler, S.L., Rosberg, Z., Sidi, M.: An optimal service policy for buffer systems. Journal of the Association Computing Machinery (JACM) 42(3), 641–657 (1995)
Chrobak, M., Csirik, J., Imreh, C., Noga, J., Sgall, J., Woeginger, G.J.: The buffer minimization problem for multiprocessor scheduling with conflicts. In: Proc. 28th International Colloquium on Automata, Languages, and Programming, pp. 862–874 (2001)
Kalyanasundaram, B., Pruhs, K.R.: An optimal deterministic algorithm for online b-matching. Theoretical Computer Science 233, 319–325 (2000)
Karp, R., Vazirani, U., Vazirani, V.: An optimal algorithm for on-line bipartite matching. In: Proceedings of 22nd Annual ACM Symposium on Theory of Computing, May 1990, pp. 352–358 (1990)
Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviridenko, M.: Buffer overflow management in QoS switches. In: Proc. 33rd ACM Symp. on Theory of Computing, pp. 520–529 (2001)
Kesselman, A., Mansour, Y.: Loss-bounded analysis for differentiated services. In: Proc. 12nd ACM-SIAM Symp. on Discrete Algorithms, pp. 591–600 (2001)
Koga, H.: Balanced scheduling toward loss-free packet queuing and delay fairness. In: Proc. 12th Annual International Symposium on Algorithms and Computation, pp. 61–73 (2001)
Lotker, Z., Patt-Shamir, B.: Nearly optimal fifo buffer management for diffserv. In: Proc. 21st ACM Symp. on Principles of Distrib. Computing, pp. 134–143 (2002)
May, M., Bolot, J.C., Jean-Marie, A., Diot, C.: Simple performance models of differentiated services for the internet. In: Proceedings of the IEEE INFOCOM 1999, pp. 1385–1394 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Azar, Y., Litichevskey, A. (2004). Maximizing Throughput in Multi-queue Switches. In: Albers, S., Radzik, T. (eds) Algorithms – ESA 2004. ESA 2004. Lecture Notes in Computer Science, vol 3221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-30140-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23025-0
Online ISBN: 978-3-540-30140-0
eBook Packages: Springer Book Archive