Sliding-banyan network performance analysis.

The sliding-banyan (SB) network employs an interleaved multistage shuffle-exchange topology, implemented with a three-dimensional free-space interconnection architecture that connects a multichip backplane to itself. Surface-normal emitters and detectors, which compose the stages' input-output, are spatially multiplexed within the same chip location, along with electronic control and switching resources. A simple deflection self-routing scheme minimizes internal contention, providing efficient use of switching and interconnection resources. The blocking performance of the SB is quantified through simulations based on realistic nonuniform traffic patterns. Results show that the SB architecture requires significantly fewer resources than other self-routing banyan-based networks. The multistage-switching and interconnection-resource requirements are close to the theoretical minimum for nonblocking networks, and the SB's distributed self-routing control resources grow only approximately linearly with the number of nodes, providing good scalability.

[1]  Thomas F. Krile,et al.  2-D Optical Multistage Interconnection Networks , 1987, Photonics West - Lasers and Applications in Science and Engineering.

[2]  A. A. Sawchuk,et al.  Geometries For Optical Implementations Of The Perfect Shuffle , 1989, Other Conferences.

[3]  J. Hui,et al.  Switching integrated broadband services by sort-banyan networks , 1991, Proc. IEEE.

[4]  Michael W. Haney,et al.  Sliding Banyan network , 1996 .

[5]  T. Egawa,et al.  Recent research trends ande issues in photonic switching technologies , 1993 .

[6]  S C Esener,et al.  Optical transpose interconnection system architectures. , 1993, Optics letters.

[7]  Yaming Wu,et al.  Optical implementation of the perfect shuffle network , 1993, Other Conferences.

[8]  Sajal K. Das,et al.  Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.

[9]  M.W. Haney,et al.  Smart pixel algorithmic tradeoffs for the Sliding Banyan network , 1996, Digest IEEE/Leos 1996 Summer Topical Meeting. Advanced Applications of Lasers in Materials and Processing.

[10]  M W Haney,et al.  Optically efficient free-space folded perfect shuffle network. , 1991, Applied optics.

[11]  Thomas J. Cloonan.  Comparative study of optical and electronic interconnection technologies for large asynchronous transfer mode packet switching applications , 1994 .

[12]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[13]  M W Haney.  Pipelined optoelectronic free-space permutation network. , 1992, Optics letters.

[14]  Marc Snir,et al.  The Performance of Multistage Interconnection Networks for Multiprocessors , 1983, IEEE Transactions on Computers.

[15]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[16]  Y Li,et al.  Compact optical generalized perfect shuffle. , 1987, Applied optics.

[17]  Michael W. Haney,et al.  Experimental evaluation of the 3-D optical shuffle interconnection module of the sliding Banyan architecture , 1996 .

[18]  A. Lohmann.  What classical optics can do for the digital optical computer. , 1986, Applied optics.

[19]  Fouad A. Tobagi,et al.  Architecture, Performance, and Implementation of the Tandem Banyan Fast Packet Switch , 1991, IEEE J. Sel. Areas Commun..

[20]  M W Haney.  Self-similar grid patterns in free-space shuffle - exchange networks. , 1993, Optics letters.

[21]  K H Brenner,et al.  Optical implementations of the perfect shuffle interconnection. , 1988, Applied optics.

[22]  R A Athale,et al.  Folded perfect shuffle optical processor. , 1988, Applied optics.

[23]  D Chariot,et al.  Ellipsometric data processing: an efficient method and an analysis of the relative errors; erratum. , 1987, Applied optics.