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 performance guarantee is provided for all traffic patterns. Azar and Richter [8] proposed an algorithm β-PG (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}{\beta - 1}\)-competitive.
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., Kushilevitz, E., Ostrovsky, R., Rosén, A.: Dynamic Routing on Networks with Fixed-Size Buffers. In: Proceedings of SODA 2003, pp. 771–780 (2003)
Albers, S., Jacobs, T.: An experimental study of new and known online packet buffering algorithms. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 63–74. Springer, Heidelberg (2007)
Albers, S., Schmidt, M.: ’On the Performance of Greedy Algorithms in Packet Buffering. SIAM Journal on Computing 35(2), 278–304 (2005)
Anderson, T., Owicki, S., Saxe, J., Thacker, C.: High speed switch scheduling for local area networks. In: ACM Trans. on Computer Systems, pp. 319–352 (November 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 Transactions on Algorithms 2(2), 282–295 (2006)
Black, D., Blake, S., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An Architecture for Differentiated Services. In: Internet RFC , vol. 2475 (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 Journal on Selected Areas in Communications 17, 1030–1039 (1999)
Dai, J.G., Prabhakar, B.: The Throughput of Data Switches with and without Speedup. In: Proceedings of INFOCOM 2000, pp. 556–564 (2000)
Datta, S., Sitaraman, R.K.: The Performance of Simple Routing Algorithms That Drop Packets. In: Proceedings of SPAA 1997, pp. 159–169 (1997)
Dolev, S., Kesselman, A.: Bounded Latency Scheduling Scheme for ATM Cells. Journal of Computer Networks 32(3), 325–331 (2000)
Epstein, L., Van Stee, R.: SIGACT news online algorithms. Chrobak, M. (ed.), vol. 35(3), pp. 58–66 (2004)
Hahne, E.L., Kesselman, A., Mansour, Y.: Competitive Buffer Management for Shared-Memory Switches. In: Proceedings of SPAA 2001, pp. 53–58 (2001)
Kesselmanm, A., Lotker, Z., Mansour, Y., Patt-Shamir, B.: Buffer Overflows of Merging Streams. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 349–360. Springer, Heidelberg (2003)
Kesselman, A., Mansour, Y.: Harmonic Buffer Management Policy for Shared Memory Switches. Theoretical Computer Science, Special Issue on Online Algorithms. In: Memoriam: Steve Seiden, vol. 324, pp. 161-182 (2004)
Kesselman, A., Rosén, A.: Scheduling Policies for CIOQ Switches. Journal of Algorithms 60(1), 60–83 (2006)
Kesselman, A., Rosén, A.: Controlling CIOQ Switches with Priority Queuing and in Multistage Interconnection Networks. Journal of Interconnection Networks (to appear)
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 Transactions on Networking 3, 226–244 (1995)
Sleator, D., Tarjan, R.: Amortized Efficiency of List Update and Paging Rules. CACM 28, 202–208 (1985)
Veres, A., Boda, M.: The Chaotic Nature of TCP Congestion Control. In: Proceedings of INFOCOM 2000, pp. 1715–1723 (March 2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kesselman, A., Kogan, K., Segal, M. (2008). Improved Competitive Performance Bounds for CIOQ Switches. In: Halperin, D., Mehlhorn, K. (eds) Algorithms - ESA 2008. ESA 2008. Lecture Notes in Computer Science, vol 5193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87744-8_48
Download citation
DOI: https://doi.org/10.1007/978-3-540-87744-8_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87743-1
Online ISBN: 978-3-540-87744-8
eBook Packages: Computer ScienceComputer Science (R0)