Abstract
The buffered crossbar switch architecture has recently gained considerable research attention. In such a switch, besides normal input and output queues, a small buffer is associated with each crosspoint. Due to the introduction of crossbar buffers, output and input contention is eliminated, and the scheduling process is greatly simplified. We analyze the performance of switch policies by means of competitive analysis, where a uniform guarantee is provided for all traffic patterns. The goal of the switch policy is to maximize the weighted throughput of the switch, that is the total value of packets sent out of the switch. For the case of unit value packets (Best Effort), we present a simple greedy switch policy that is 4-competitive. For the case of variable value packets, we consider the Priority Queueing (PQ) mechanism, which provides better Quality of Service (QoS) guarantees by decreasing the delay of real-time traffic. We propose a preemptive greedy switch policy that achieves a competitve ratio of 18. Our results hold for any value of the switch fabric speedup. Moreover, the presented policies incur low overhead and are amenable to efficient hardware implementation at wire speed. To the best of our knowledge, this is the first work on competitive analysis for the buffered crossbar switch architecture.
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
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. 754–765. 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)
Azar, Y., Litichevskey, M.: Maximizing throughput in multi-queue switches. Algorithmica 45(1), 69–90 (2006)
Azar, Y., Richter, Y.: Management of Multi-Queue Switches in QoS Networks. In: Algorithmica, vol. 43(1-2), pp. 81–96 (2005)
Azar, Y., Richter, Y.: An improved algorithm for CIOQ switches. ACM Transactions on Algorithms 2(2), 282–295 (2006)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Black, D., Blake, S., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An Architecture for Differentiated Services, Internet RFC 2475 (December 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)
Chuang, S.T., Iyer, S., McKeown, N.: Practical Algorithms for Performance Guarantees in Buffered Crossbars. In: Proc. INFOCOM 2005, vol. 2, pp. 981–991 (2005)
Clark, D., Fang, W.: Explicit Allocation of Best Effort Packet Delivery Service. IEEE/ACM Trans. on Networking 6(4), 362–373 (1998)
Dai, J., Prabhakar, B.: The throughput of data switches with and without speedup. In: Proc. IEEE INFOCOM 2000, March 2000, vol. 2, pp. 556–564 (2000)
Giaccone, P., Leonardi, E., Prabhakar, B., Shah, D.: Delay Performance of High-speed Packet Switches with Low Speedup. In: Proc. IEEE GLOBECOM 2002, November 2002, vol. 3, pp. 2629–2633 (2002)
Hahne, E.L., Kesselman, A., Mansour, Y.: Competitive Buffer Management for Shared-Memory Switches. In: Proc. SPAA, July 2001, pp. 53–58 (2001)
Iyer, S., Zhang, R., McKeown, N.: Routers with a Single Stage of Buffering. ACM SIGCOMM 3(4), 251–264 (2002)
Javidi, T., Magill, R., Hrabik, T.: A High Throughput Scheduling Algorithm for a Buffered Crossbar Switch Fabric. In: Proc. IEEE International Conference on Communications, vol. 5, pp. 1586–1591 (2001)
Karol, M., Hluchyj, M., Morgan, S.: Input versus Output Queuing an a Space Division Switch. IEEE Trans. Communications 35(12), 1347–1356 (1987)
Kesselmanm, A., Lotker, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviridenko, M.: Buffer Overflow Management in QoS Switches. SIAM Journal on Computing 33(3), 563–583 (2004)
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 324(2-3), 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)
McKeown, N.: iSLIP: A Scheduling Algorithm for Input-Queued Switches. IEEE Transactions on Networking 7(2), 188–201 (1999)
McKeown, N., Mekkittikul, A., Anantharam, V., Walrand, J.: Achieving 100% Throughput in an Input-Queued Switch. IEEE Transactions on Communications 47(8), 1260–1267 (1999)
Nabeshima, M.: Performance evaluation of combined input-and crosspoint- queued switch. IEICE Trans. Commun. E83-B(3), 737–741 (2000)
Sleator, D., Tarjan, R.: Amortized Efficiency of List Update and Paging Rules. Communications of the ACM 28(2), 202–208 (1985)
Paxson, V., Floyd, S.: Wide Area Traffic: The Failure of Poisson Modeling. IEEE/ACM Transactions on Networking 3(3), 226–244 (1995)
Veres, A., Boda, M.: The Chaotic Nature of TCP Congestion Control. In: Proc. INFOCOM, March 2000, vol. 3, pp. 1715–1723 (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). Best Effort and Priority Queuing Policies for Buffered Crossbar Switches . In: Shvartsman, A.A., Felber, P. (eds) Structural Information and Communication Complexity. SIROCCO 2008. Lecture Notes in Computer Science, vol 5058. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69355-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-69355-0_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69326-0
Online ISBN: 978-3-540-69355-0
eBook Packages: Computer ScienceComputer Science (R0)