An efficient switching system for next-generation large-scale computer networking

A switching fabric called the spherical switching network (SSN) for high-speed applications in next-generation networking is introduced. The performance evaluation and comparison show that this network clearly outperforms typical interconnection networks currently being deployed in practical switches and routers such as a multi-stage network. The spherical switching network has a cyclic, regular, and highly expandable structure with a simple self-routing scheme. The network is constructed with fixed-size switch elements regardless of the size of the network. Each switch element consists of a carefully-selected sized 9 /spl times/ 9 crossbar and a local controller. One of the nine pairs of links is external and carries the external traffic, and the other eight pairs are internal. The contention resolution in each switch element is based on deflection of losing packets and incremental priority of packets. In order to keep the number of deflections low, each incoming external link is connected to a buffer with flow control capabilities. Due to the special arrangement of interconnections in the network, the network operates efficiently since the occurrence of deflections is dramatically reduced.

[1]  G. Jack Lipovski,et al.  Banyan networks for partitioning multiprocessor systems , 1973, ISCA '73.

[2]  H. Suzuki,et al.  Output-buffer switch architecture for asynchronous transfer mode , 1989, IEEE International Conference on Communications, World Prosperity Through Communications,.

[3]  V. Benes,et al.  Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .

[4]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[5]  Gérard Hébuterne Traffic Flow in Switching Systems , 1987 .

[6]  Keith W. Ross,et al.  On Nonblocking Multirate Interconnection Networks , 1991, SIAM J. Comput..

[7]  Paolo Giacomazzi,et al.  Shuffle interconnection networks with deflection routing for ATM switching: The Closed-Loop Shuffleout , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[8]  Anthony S. Acampora,et al.  The Knockout Switch: A Simple, Modular Architecture for High-Performance Packet Switching , 1987, IEEE J. Sel. Areas Commun..

[9]  N. Mirfakhraei Performance analysis of a large-scale switching system for high-speed ATM networks , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

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

[11]  W. David Sincoskie,et al.  Sunshine: A High-Performance Self-Routing Broadband Packet Switch Architecture , 1991, IEEE J. Sel. Areas Commun..

[12]  Charles Clos,et al.  A study of non-blocking switching networks , 1953 .

[13]  Sibabrata Ray,et al.  MSXmin: a modular multicast ATM packet switch with low delay and hardware complexity , 2000, TNET.

[14]  Jonathan S. Turner An optimal nonblocking multicast virtual circuit switch , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[15]  Daniel M. Dias,et al.  Analysis and Simulation of Buffered Delta Networks , 1981, IEEE Transactions on Computers.

[16]  Eric Wing Ming Wong,et al.  Analysis of rerouting in circuit-switched networks , 2000, TNET.

[17]  David G. Cantor,et al.  On non-blocking switching networks , 1971, Networks.