Skip to main content
SpringerLink
Log in

Mesh of Trees Topology for Output Queued Switches: Trading Speed-up with a Pipeline Technique

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

In this paper we propose an output queued switch architecture based on the mesh of trees topology. We establish the equivalence of our proposal with the output queued model, with respect to a large variety of queuing techniques, and we analyze its features, showing that in principle it could be a practical solution to guarantee quality of service. Moreover, such an architecture is able to easily and efficiently manage multicast traffic, which is becoming extremely important in order to offer multimedia (specially voice and video) services over the network.

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.

Similar content being viewed by others

References

  1. M.G. Hluchyj and M.J. Karol, Queueing in high-performance packet switching, IEEE Journal on Selected Areas in Communications 6(9) (December 1988) 1587–1597.

    Google Scholar 

  2. T.E. Anderson, S.S. Owicki, J.B. Saxe and C.P. Thacker, High-speed switch scheduling for local-area networks, ACM Transactions on Computer Systems 11(4) (1993) 319–352.

    Google Scholar 

  3. N. Mckeown, M. Izzard, A. Mekkittikul, W. Ellersick and M. Horowitz, The tiny tera: A packet core switch, Hot Interconnects IV, Stanford University (August 1996) pp. 161–173.

  4. C. Partridge, P.P. Carvey, E. Burgess, I. Castineyra, T. Clarke, L. Graham, M. Hathaway, P. Herman, A. King, S. Kohalmi, T. Ma, J. Mcallen, T. Mendez, W.C. Milliken, R. Pettyjohn, J. Rokosz, J. Seeger, M. Sollins, S. Storch, B. Tober, G.D. Troxel, D. Waitzman and S. Winterble, A 50 Gb/s IP router, IEEE/ACM Transactions on Networking 6(3) (1998) 237–248.

    Google Scholar 

  5. J.P. Coudreuse and M. Servel, PRELUDE: An asynchronous time-division switched network, in: Proceedings of IEEE International Conference on Communications ‘87 (1987) pp. 769–773.

  6. N. Endo, T. Kozaki, T. Ohuchi, H. Kuwahara and S. Gohara, Shared buffer memory switch for an ATM exchange, IEEE Transactions on Communications 41(1) (1993) 237–245.

    Google Scholar 

  7. S. Iyer and N. McKeown, Routers with a single stage of buffering, in: Proceedings of ACM SIGCOMM (2002).

  8. S. Iyer and N. McKeown, Techniques for fast shared memory switches, unpublished manuscript, available at http://klamath.stanford.edu/sun-daes/Papers/Unpub/sharedmemv1.0.pdf.

  9. M.J. Karol, M.G. Hluchyj and S. Morgan, Input versus output queue-ing on a space division switch, IEEE Transactions on Communications 35 (1987) 1347–1356.

    Google Scholar 

  10. H. Zhang, Service disciplines for guaranteed performance service in packet switching networks, Proceedings of the IEEE 83(10) (1995) 1374–1396.

    Google Scholar 

  11. M. Karol, K. Eng and H. Obara, Improving the performance of input-queued atm packet-switching, in: Proceedings of IEEE INFOCOM ‘92 (1992) pp. 110–115.

  12. L. Tassiulas and A. Ephremides, Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks, IEEE Transactions on Automatic Control 37(12) (1992) 1936–1948.

    Google Scholar 

  13. L. Tassiulas, Linear complexity algorithms for maximum throughput in radio networks and input queued switches, in: Proceedings of IEEE INFOCOM ‘98 (1998) pp. 533–539.

  14. N. McKeown, V. Anantharam and J. Walrand, Achieving 100% throughput in an input-queued switch, in: Proceedings of IEEE INFOCOM ‘96 (1996) pp. 296–302.

  15. Y. Li, S. Panwar and H.J. Chao, On the performance of a dual round-robin switch, in: Proc. of IEEE INFOCOM (2001).

  16. A. Mekkittikul and N. McKeown, A starvation-free algorithm for achieving 100% throughput in an input-queued switch, in: Proceedings of the ICCCN (1996) pp. 226–231.

  17. N. McKeown, Scheduling algorithms for input queued cell switches, Ph.D. thesis, University of California at Berkeley (1995).

  18. C.S. Chang, W.J. Chen and H.Y. Huang, On service guarantees for input buffered crossbar switches: A capacity decomposition approach by Birkoff and von Neumann, in: IEEE IWQoS’99 (1999) pp. 79–86.

  19. R.E. Tarjan, Data Structures and Network Algorithms (SIAM, 1983).

  20. C.S. Chang, W.J. Chen and H.Y. Huang, Birkhoff–von Neumann input buffered crossbar switches, in: Proc. of IEEE INFOCOM (2000).

  21. N. McKeown, The islip scheduling algorithm for input-queued switches, IEEE/ACM Transactions on Networking 7(2) (April 1999) 188–201.

    Google Scholar 

  22. M.W. Goudreau, S.G. Kolliopoulos and S.B. Rao, Scheduling algorithms for input-queued switches: Randomized techniques and experimental evaluation, in: Proc. of IEEE INFOCOM (2000).

  23. W. Leland, M. Taqqu, W. Willinger and D. Wilson, On the self-similar nature of ethernet traffic (extended version), IEEE/ACM Transactions on Networking 2(1) (1994) 1–15.

    Google Scholar 

  24. E. Leonardi, M. Mellia, F. Neri and M. Ajmone Marsan, Bounds on average delays and queue size averages and variances in input-queued cell based switches, in: Proc. of IEEE INFOCOM (2001).

  25. S.T. Chuang, A. Goel, N. McKeown and B. Prabhakar, Matching output queueing with a combined input output queued switch, IEEE Journal on Selected Areas in Communications 17(6) (1999) 1030–1039. (A preliminary version appears in Proceedings of INFOCOM ‘99.)

    Google Scholar 

  26. B. Prabhakar and N. McKeown, On the speedup required for combined input and output queued switching, Automatica 35(12) (1999) 1909–1920.

    Google Scholar 

  27. M. Andrews and L. Zhang, Achieving stability in networks of input-queued switches, in: Proc. of IEEE INFOCOM (2001).

  28. F.M. Chiussi, D.A. Khotimsky and S. Krihsnan, Generalized inverse multiplexing of switched atm connections, in: Proc. of IEEE GLOBECOM ‘98 (1998).

  29. F.M. Chiussi, D.A. Khotimsky and S. Krihsnan, Advanced frame recovery in switched connection inverse multiplexing for atm, in: Proc. of IEEE International Conference on ATM ‘99 (1999).

  30. D.A. Khotimsky and S. Krihsnan, Stability analysis of a parallel packet switch with bufferless input demultiplexor, in: Proc. of IEEE ICC 2001 (2001).

  31. S. Iyer, A. Awadallah and N. McKeown, Analysis of a packet switch with memories running slower than the line-rate, in: Proceedings of IEEE INFOCOM (2000).

  32. S. Iyer and N. McKeown, Making parallel packet switches practical, in: Proceedings of IEEE INFOCOM (2001).

  33. A. Mekkittikul and N. McKeown, A practical scheduling algorithm to achieve 100% throughput in input-queued switches, in: Proceedings of IEEE INFOCOM ‘98 (1998) pp. 792–799.

  34. A. Mekkittikul, Scheduling non-uniform traffic in high speed packet switches and routers, Ph.D. thesis, Stanford University (1998).

  35. Y.S. Yeh, M.G. Hluchyj and A.S. Acampora, The knockout switch: A simple modular architecture for high performance switching, IEEE Journal on Selected Areas in Communications SAC-5 (October 1987) 1274–1283.

  36. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes (Morgan Kaufmann, Los Altos, CA, 1992).

    Google Scholar 

  37. F.P. Preparata and J.E. Vuillemin, Area-time optimal vlsi networks for matrix multiplication, Information Processing Letters 11(2) (1980) 77–80.

    Google Scholar 

  38. Z. Liu and R. Righter, Scheduling multicast input-queued switches, Journal of Scheduling 2(3) (May 1999) 99–114.

    Google Scholar 

  39. M. Ajmone Marsan, A. Bianco, P. Giaccone, E. Leonardi and F. Neri, On the throughput of input-queued cell-based switches with multicast traffic, in: Proc. of IEEE INFOCOM (2001).

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56100, Pisa, Italy

    Maurizio A. Bonuccelli & Alessandro Urpi

Authors
  1. Maurizio A. Bonuccelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alessandro Urpi
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bonuccelli, M.A., Urpi, A. Mesh of Trees Topology for Output Queued Switches: Trading Speed-up with a Pipeline Technique. Cluster Comput 8, 7–14 (2005). https://doi.org/10.1007/s10586-004-4432-9

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-004-4432-9

Keywords

Search

Navigation