Skip to main content
SpringerLink
Log in

Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing

  • Published:
Distributed Computing Aims and scope Submit manuscript

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 dependency 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. We assume that each packet has an intrinsic value designating its priority and the goal of the switch policy is to maximize the weighted throughput of the switch. We consider FIFO queueing buffering policies, which are deployed by the majority of today’s Internet routers. In packet-mode scheduling, a packet is divided into a number of unit length cells and the scheduling policy is constrained to schedule all the cells contiguously, which removes reassembly overhead and improves Quality-of-Service. For the case of variable length packets with uniform value density (Best Effort model), where the packet value is proportional to its size, we present a packet-mode greedy switch policy that is 7-competitive. For the case of unit size packets with variable values (Differentiated Services model), we propose a β-preemptive (β is a preemption factor) greedy switch policy that achieves a competitive ratio of 6 + 4β + β 2 + 3/(β − 1). In particular, its competitive ratio is at most 19.95 for the preemption factor of β = 1.67. As far as we know, this is the first constant-competitive FIFO policy for this architecture in the case of variable value packets. In addition, we evaluate performance of β-preemptive greedy switch policy by simulations and show that it outperforms other natural switch policies. The presented policies are simple and thus can be efficiently implemented at high speeds. Moreover, our results hold for any value of the internal switch fabric speedup.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. 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)

  2. Albers, S., Jacobs, T.: An experimental study of new and known online packet buffering algorithms. In: Proceedings of ESA, pp. 754–765 (2007)

  3. Albers S., Schmidt M.: On the performance of greedy algorithms in packet buffering. SIAM J. Comput. 35(2), 278–304 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  4. Attiya, H., Hay, D., Keslassy, I.: Packet-mode emulation of output-queued switches. In: Proceedings of SPAA, pp. 138–147 (2006)

  5. Azar Y., Litichevskey M.: Maximizing throughput in multi-queue switches. Algorithmica 45(1), 69–90 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  6. Azar Y., Richter Y.: Management of multi-queue switches in QoS networks. Algorithmica 43(1–2), 81–96 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  7. Azar Y., Richter Y.: An improved algorithm for CIOQ switches. ACM Trans. Algorithms 2(2), 282–295 (2006)

    Article  MathSciNet  Google Scholar 

  8. Black, D., Blake, S., Carlson, M., Davies, Z.W.E., Weiss, W.: An architecture for differentiated services. Internet RFC 2475, December (1998)

  9. Borodin A., El-Yaniv R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)

    MATH  Google Scholar 

  10. Chuang, S., Iyer, S., McKeown, N.: Practical algorithms for performance guarantees in buffered crossbars. In: Proceedings of IEEE INFOCOM, pp. 981–991 (2005)

  11. 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)

    Article  Google Scholar 

  12. Clark D., Fang W.: Explicit allocation of best effort packet delivery service. IEEE/ACM Trans. Netw. 6(4), 362–373 (1998)

    Article  Google Scholar 

  13. Dai, J., Prabhakar, B.: The throughput of data switches with and without speedup. In: Proceedings of IEEE INFOCOM, pp. 556–564 (2000)

  14. Giaccone, P., Leonardi, E., Prabhakar, B., Shah, D.: Delay performance of high-speed packet switches with low speedup. In: Proceedings of IEEE GLOBECOM, pp. 291–301 (2002)

  15. Guez, D., Kesselman, A., Rosén, A.: Packet-mode policies for input-queued switches. In: Proceedings of SPAA, pp. 93–102 (2004)

  16. Hahne, E.L., Kesselman, A., Mansour, Y.: Competitive buffer management for shared-memory switches. In: Proceedings of SPAA, pp. 53–58 (2001)

  17. International Technology Roadmap for Semiconductors (ITRS). Executive summary (2007)

  18. Javidi T., Magill R., Hrabik T.: A high throughput scheduling algorithm for a buffered crossbar switch fabric. Proc. IEEE Int. Conf. Commun. 5, 1586–1591 (2001)

    Google Scholar 

  19. Kanizo, Y., Hay, D., Keslassy, I.: The crosspoint-queued switch. In: Proceedings of IEEE INFOCOM, pp. 729–737 (2009)

  20. Kar K., Lakshman T., Stiliadis D., Tassiulas L.: Reduced complexity input buffered switches. HOT Interconnects 12(2), 13–20 (2000)

    Google Scholar 

  21. Katevenis, M., Passas, G., Simos, D., Papaefstathiou, I., Chrysos, N.: Variable packet size buffered crossbar (CICQ) switches. In: Proceedings of IEEE international conference communications, pp. 1090–1096 (2004)

  22. Kesselman, A., Kogan, K., Segal, M.: Competitive policies for buffered crossbar switches. In: Proceedings of 15th SIROCCO 2008, Springer LNCS 5058, pp. 170–184 (2008)

  23. Kesselman, A., Kogan, K., Segal, M.: Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing. In: Proceedings of 27th PODC 2008, pp. 335–344 (2008)

  24. Kesselman A., Mansour Y.: Harmonic buffer management policy for shared memory switches. Theor. Comput. Sci. Spec. Issue Online Algorithms In Memoriam: Steve Seiden 324(2–3), 161–182 (2004)

    MATH  MathSciNet  Google Scholar 

  25. Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B.: Buffer overflows of merging streams. In: Proceedings of ESA, pp. 349–360 (2003)

  26. Kesselman A., Lotker Z., Mansour B.P.-S.Y., Schieber B., Sviridenko M.: Buffer overflow management in QoS switches. SIAM J. Comput. 33(3), 563–583 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  27. Kesselman A., Rosén A.: Scheduling policies for CIOQ switches. J. Algorithms 60(1), 60–83 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  28. Kesselman A., Rosén A.: Controlling CIOQ switches with priority queuing and in multistage interconnection networks. J. Interconnect. Netw. 9(1/2), 53–72 (2008)

    Article  Google Scholar 

  29. Marsan, M.A., Bianco, A., Giaccone, P., Leonardi, E., Neri, F.: Scheduling in input-queued cell-based packet switches. In: Proceedings of IEEE GLOBECOM, pp. 1227–1235 (1999)

  30. Magill, B., Rohrs, C., Stevenson, R.: Output-queued switch emulation by fabrics with limited memory. IEEE J. Sel. Areas Commun. 606–615 (2003)

  31. Paxson, V., Floyd, S.: Wide area traffic: the failure of Poisson modeling. IEEE/ACM Trans. Netw. (1995)

  32. Rojas-Cessa, R., Oki, E., Jonathan Chao, H.: CIXOB-k: Combined input-crosspoint-output buffered packet switch. In: Proceedings of IEEE GLOBECOM, pp. 2654–2660 (2001)

  33. Sleator D., Tarjan R.: Amortized efficiency of list update and paging rules. CACM 28 12(2), 202–208 (1985)

    MathSciNet  Google Scholar 

  34. The National Laboratory for Applied Network Research. Wan Packet Size Distribution. Available online at: http://www.nlanr.net/NA/Learn/packetsizes.html

  35. Turner, J.: Strong performance guarantees for asynchronous buffered crossbar schedulers. ACM/IEEE Trans. Netw. (to appear) (2009)

  36. Veres, A., Boda, M.: The chaotic nature of TCP congestion control. In: Proceedings of IEEE INFOCOM, pp. 1715–1723 (2000)

Download references

Author information

Authors and Affiliations

  1. Google Inc., Mountain View, CA, USA

    Alex Kesselman

  2. Cisco Systems and the Department of Communication Systems Engineering, Ben-Gurion University, Beersheba, Israel

    Kirill Kogan

  3. Department of Communication Systems Engineering, Ben-Gurion University, Beersheba, Israel

    Michael Segal

Authors
  1. Alex Kesselman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kirill Kogan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michael Segal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kirill Kogan.

Additional information

A preliminary version of this paper appeared in [23].

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kesselman, A., Kogan, K. & Segal, M. Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing. Distrib. Comput. 23, 163–175 (2010). https://doi.org/10.1007/s00446-010-0114-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-010-0114-4

Keywords

Search

Navigation