Abstract
The problem of maximizing the weighted throughput in various switching settings has been intensively studied recently through competitive analysis. To date, the most general model that has been investigated is the standard CIOQ (Combined Input and Output Queued) switch architecture with internal fabric speedup S ≥ 1. CIOQ switches, that comprise the backbone of packet routing networks, are N × N switches controlled by a switching policy that incorporates two components: admission control and scheduling. An admission control strategy is essential to determine the packets stored in the FIFO queues in input and output ports, while the scheduling policy conducts the transfer of packets through the internal fabric, from input ports to output ports. The online problem of maximizing the total weighted throughput of CIOQ switches was recently investigated by Kesselman and Rosén in [12]. They presented two different online algorithms for the general problem that achieve non-constant competitive ratios (linear in either the speedup or the number of distinct values or logarithmic in the value range). We introduce the first constant-competitive algorithm for the general case of the problem, with arbitrary speedup and packet values. Specifically, our algorithm is 9.47-competitive, and is also simple and easy to implement.
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.
Similar content being viewed by others
References
Aiello, W.A., Mansour, Y., Rajagopolan, S., Rosén, 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) (to appear)
Andelman, N., Mansour, Y., Zhu, A.: Competitive queueing policies for QoS switches. In: Proc. 14th ACM-SIAM Symp. on Discrete Algorithms, pp. 761–770 (2003)
Andrews, M., Awerbuch, B., Fernández, A., Kleinberg, J., Leighton, T., Liu, Z.: Universal stability results for greedy contention-resolution protocols. In: Proc. 37th IEEE Symp. on Found. of Comp. Science, pp. 380–389 (1996)
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) (to appear)
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)
Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.: Adversarial queuing theory. In: Proc. 28th ACM Symp. on Theory of Computing, pp. 376–385 (1996)
Hahne, E.L., Kesselman, A., Mansour, Y.: Competitive buffer management for shared-memory switches. In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 53–58 (2001)
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. 12th ACM-SIAM Symp. on Discrete Algorithms, pp. 591–600 (2001)
Kesselman, A., Rosén, A.: Scheduling policies for CIOQ switches. In: Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 353–362 (2003)
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., Richter, Y. (2004). An Improved Algorithm for CIOQ 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_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-30140-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23025-0
Online ISBN: 978-3-540-30140-0
eBook Packages: Springer Book Archive