Abstract
In this paper we propose an architecture for an output queued switch based on the mesh of trees topology. After establishing the equivalence of our proposal with the output queued model, we analyze its features, showing that it merges positive features of the input queued switches (specially their implementability) with all the characteristics typical of output queued ones. Moreover, such an architecture is able to easily and efficiently manage multicast traffic, which is becoming extremely important in networks with traditional communication services integrated in.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. G. Hluchyj and M. J. Karol. Queueing in high-performance packet switching. IEEE Journal on Selected Areas in Communications, 6(9):1587–1597, Dec. 1988.
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):319–352, Nov. 1993.
N. Mckeown, M. Izzard, A. Mekkittikul, W. Ellersick, and M. Horowitz. The tiny tera: a packet core switch. Hot Interconnects IV, (Sstanford University), pages 161–173, Aug. 1996.
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):237–248, Jun. 1998.
J. P. Coudreuse and M. Servel. PRELUDE: an asynchronous time-division switched network. In Proceedings of IEEE International Conference on Communications’ 87, pages 769–773, 1987.
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):237–245, Jan. 1993.
M. J. Karol, M. G. Hluchyj, and S. Morgan. Input versus output queueing on a space division switch. IEEE Transactions on Communications, 35:1347–1356, 1987.
H. Zhang. Service disciplines for guaranteed performance service in packet switching networks. Proceedings of the IEEE, 83(10):1374–1396, Oct 1995.
M. Karol, K. Eng, and H. Obara. Improving the performance of input-queued atm packet-switching. In Proceedings of IEEE INFOCOM’ 92, pages 110–115, 1992.
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):1936–1948, Dec. 1992.
L. Tassiulas. Linear complexity algorithms for maximum throughput in radio networks and input queued switches. In Proceedings of IEEE INFOCOM’ 8, pages 533–539, 1998.
N. McKeown, V. Anantharam, and J. Walrand. Achieving 100% throughput in an input-queued switch. In Proceedings of IEEE INFOCOM’ 96, pages 296–302, 1996.
Y. Li, S. Panwar, and H. J. Chao. On the performance of a dual round-robin switch. In Proc. of IEEE Infocom 2001, 2001.
A. Mekkittikul and N. McKeown. A starvation-free algorithm for achieving 100% throughput in an input-queued switch. In Proceedings of the ICCCN, pages 226–231, 1996.
N. McKeown. Scheduling algorithms for input queued cell switches. PhD thesis, University of California at Berkeley, 1995.
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, pages 79–86, 1999.
R. E. Tarjan. Data structures and network algorithms. Society for industrial and apllied mathematics, 1983.
C.S. Chang, W.J. Chen, and H.Y. Huang. Birkhoff-von neumann input buffered crossbar switches. In Proc. of IEEE Infocom 2000, 2000.
N. McKeown. The islip scheduling algorithm for input-queued switches. IEEE/ ACM Transactions on Networking, 7(2):188–201, Apr. 1999.
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, 2000.
W. Leland, M. Taqqu, W. Willinger, and D. Wilson. On the self-similar nature of ethernet traffic (extended version, 1994.
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, 2001.
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):1030–1039, 1999. (A preliminary version appears in Proceedings of INFOCOM’ 99).
B. Prabhakar and N. McKeown. On the speedup required for conbined input and output queued switching. Automatica, 35(12):1909–1920, Dec. 1999.
M. Andrews and L. Zhang. Achieving stability in networks of input-queued switches. In Proc. of IEEE Infocom 2001, 2001.
F. M. Chiussi, D. A. Khotimsky, and S. Krihsnan. Generalized inverse multiplexing of switched atm connections. In Proc. of IEEE Globecom’ 98, 1998.
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.
D. A. Khotimsky and S. Krihsnan. Stability analysis of a parallel packet switch with bufferless input demultiplexor. In Proc. of IEEE ICC 2001, 2001.
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, 2000.
S. Iyer and N. McKeown. Making parallel packet switches practical. In Proceedings of IEEE INFOCOM 2001, 2001.
A. Mekkitikul and N. McKeown. A practical scheduling algorithm to achieve 100% throughput in input-queued switches. In Proceedings of IEEE INFOCOM’ 98, pages 792–799, 1998.
A. Mekkittikul. Scheduling non-uniform traffic in high speed packet switches and routers. PhD thesis, Stanford University, 1998.
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:1274–1283, Oct. 1987.
F. T. Leighton. Introduction to parallel algorithms and architectures: arrays, trees, h ypercubes. Morgan Kaufmann, 1992.
F. P. Preparata and J. E. Vuillemin. Area-time optimal vlsi networks for matrix multiplication. 11(2):77–80, 1980.
Z. Liu and R. Righter. Scheduling multicast input-queued switches. Journal of scheduling, 2(3):99–114, May 1999.
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, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bonuccelli, M.A., Urpi, A. (2002). A Multicast FCFS Output Queued Switch without Speedup. In: Gregori, E., Conti, M., Campbell, A.T., Omidyar, G., Zukerman, M. (eds) NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications. NETWORKING 2002. Lecture Notes in Computer Science, vol 2345. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47906-6_86
Download citation
DOI: https://doi.org/10.1007/3-540-47906-6_86
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43709-3
Online ISBN: 978-3-540-47906-2
eBook Packages: Springer Book Archive