Abstract
Combined Input and Output Queued (CIOQ) architectures with a moderate fabric speedup S>1 have come to play a major role in the design of high performance switches. In this paper we study CIOQ switches with First-In-First-Out (FIFO) buffers providing Quality of Service (QoS) guarantees. The goal of the switch policy is to maximize the total value of packets sent out of the switch. We analyze the performance of a switch policy by means of competitive analysis, where a uniform worst-case performance guarantee is provided for all traffic patterns. Azar and Richter (ACM Trans. Algorithms 2(2):282–295, 2006) proposed the β-PG algorithm (Preemptive Greedy with a preemption factor of β) that is 8-competitive for an arbitrary speedup value when β=3. We improve upon their result by showing that this algorithm achieves a competitive ratio of 7.5 and 7.47 for β=3 and β=2.8, respectively. Basically, we demonstrate that β-PG is at most \(\frac{\beta^{2} + 2\beta}{\beta - 1}\) and at least \(\frac{\beta^{2}}{\beta - 1}\)-competitive.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aiello, W., Kushilevitz, E., Ostrovsky, R., Rosén, A.: Dynamic routing on networks with fixed-size buffers. In: Proceedings of SODA, pp. 771–780 (2003)
Albers, S., Jacobs, T.: An experimental study of new and known online packet buffering algorithms. In: Proc. 15th Annual European Symposium on Algorithms. LNCS, vol. 4698, pp. 63–74 (2007)
Albers, S., Schmidt, M.: On the performance of greedy algorithms in packet buffering. SIAM J. Comput. 35(2), 278–304 (2005)
Anderson, T., Owicki, S., Saxe, J., Thacker, C.: High speed switch scheduling for local area networks. ACM Trans. on Computer Systems 319–352 (1993)
Azar, Y., Litichevskey, M.: Maximizing throughput in multi-queue switches. Algorithmica 45(1), 69–90 (2006)
Azar, Y., Richter, Y.: The zero-one principle for switching networks. In: Proceedings of STOC 2004, pp. 64–71 (2004)
Azar, Y., Richter, Y.: Management of multi-queue switches in QoS networks. Algorithmica 43(1–2), 81–96 (2005)
Azar, Y., Richter, Y.: An improved algorithm for CIOQ switches. ACM Trans. Algorithms 2(2), 282–295 (2006)
Black, D., Blake, S., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An architecture for differentiated services. Internet RFC 2475 (December 1998)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Chuang, S.T., Goel, A., McKeown, N., Prabhakar, B.: Matching output queueing with a combined input output queued switch. IEEE J. Sel. Areas Commun. 17, 1030–1039 (1999)
Dai, J.G., Prabhakar, B.: The throughput of data switches with and without speedup. In: Proceedings of INFOCOM, pp. 556–564 (2000)
Dolev, S., Kesselman, A.: Bounded latency scheduling scheme for ATM cells. Comput. Netw. ISDN Syst. 32(3), 325–331 (2000)
Englert, M., Westermann, M.: Lower and upper bounds on FIFO buffer management in QoS switches. In: Proceedings of ESA, pp. 352–363 (2006)
Epstein, L., Van Stee, R.: SIGACT News 35(3), 58–66 (2004)
Hahne, E.L., Kesselman, A., Mansour, Y.: Competitive buffer management for shared-memory switches. In: Proceedings of SPAA, pp. 53–58 (2001)
Kesselman, A., Kogan, K., Segal, M.: Best effort and priority queuing policies for buffered crossbar switches. In: SIROCCO, pp. 170–184 (2008). doi:10.1007/978-3-540-69355-0_15
Kesselman, A., Kogan, K., Segal, M.: Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing. Distrib. Comput. 23(3), 163–175 (2010). doi:10.1007/s00446-010-0114-4
Kesselmanm, A., Lotker, Z., Mansour, Y., Patt-Shamir, B.: Buffer overflows of merging streams. In: Proceedings of ESA, pp. 349–360 (2003)
Kesselman, A., Mansour, Y.: Harmonic buffer management policy for shared memory switches. Theor. Comput. Sci. 324, 161–182 (2004). Special Issue on Online Algorithms, In Memoriam: Steve Seiden
Kesselman, A., Rosén, A.: Scheduling policies for CIOQ switches. J. Algorithms 60(1), 60–83 (2006)
Kesselman, A., Rosén, A.: Controlling CIOQ switches with priority queuing and in multistage interconnection networks. J. Int. Netw. 9(1/2), 53–72 (2008). doi:10.1142/S0219265908002151
Marsan, M.A., Bianco, A., Filippi, E., Giaccone, P., Leonardi, E., Neri, F.: A comparison of input queuing cell switch architectures. In: Proceedings of 3rd International Workshop on Broadband Switching Systems, Kingston, Canada, June 1999
McKeown, N.: Scheduling algorithms for input-queued cell switches. Ph.D. Thesis, University of California at Berkeley (1995)
Paxson, V., Floyd, S.: Wide area traffic: the failure of Poisson modeling. IEEE/ACM Trans. Netw. 3, 226–244 (1995)
Sleator, D., Tarjan, R.: Amortized efficiency of list update and paging rules. Commun. ACM 28, 202–208 (1985)
Veres, A., Boda, M.: The chaotic nature of TCP congestion control. In: Proceedings of INFOCOM 2000, March 2000, pp. 1715–1723 (2000)
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of this work appeared in Proceedings of ESA 2008.
Rights and permissions
About this article
Cite this article
Kesselman, A., Kogan, K. & Segal, M. Improved Competitive Performance Bounds for CIOQ Switches. Algorithmica 63, 411–424 (2012). https://doi.org/10.1007/s00453-011-9539-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-011-9539-9