Performance of shuffle-like switching networks with deflection

Four packet-switched networks using shuffle-exchange interconnections and deflection routing are analyzed. The first two are well-known networks based solely on shuffle interconnections, and the other two are variations in which the negative effects of deflection are reduced. Approximate state equations are given under a uniform traffic assumption. The equations predict the distribution of packet delay and can be used in situations where packets are assigned priorities. The four networks are briefly compared to each other and to Batcher-Banyan sorting networks and hypercube deflection networks.<<ETX>>

[1]  J. Y. Ngai,et al.  A framework for adaptive routing in multicomputer networks , 1989, CARN.

[2]  Alan Huang,et al.  Starlite: a wideband digital switch , 1991 .

[3]  Anthony S. Acampora,et al.  Terabit lightwave networks: The multihop approach , 1987, AT&T Technical Journal.

[4]  A. S. Acampora,et al.  Multihop lightwave networks: a new approach to achieve terabit capabilities , 1988, IEEE International Conference on Communications, - Spanning the Universe..

[5]  N. F. Maxemchuk,et al.  Regular mesh topologies in local and metropolitan area networks , 1985, AT&T Technical Journal.

[6]  Burton J. Smith.  Architecture And Applications Of The HEP Multiprocessor Computer System , 1982, Optics & Photonics.

[7]  Nicholas F. Maxemchuk,et al.  Comparison of deflection and store-and-forward techniques in the Manhattan Street and Shuffle-Exchange Networks , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[8]  Nicholas F. Maxemchuk,et al.  Routing in the Manhattan Street Network , 1987, IEEE Trans. Commun..

[9]  P. Baran,et al.  On Distributed Communications Networks , 1964 .

[10]  X.-N. Tan,et al.  Optimal routing in the shuffle-exchange networks for multiprocessor systems , 1988, [Proceedings] COMPEURO 88 - System Design: Concepts, Methods and Tools.