Design of photonic rearrangeable networks with zero first-order switching-element-crosstalk

The development of optical cross-connect architectures is a very important topic today. We consider here in particular the class of optical space-division switching fabrics configured as multistage structures built with 2/spl times/2 optical switching elements (SEs) and derived from a combination of vertical replication and horizontal expansion of Banyan networks. We determine the necessary and sufficient conditions for these matrices to be rearrangeably nonblocking and free of first-order crosstalk in SEs. This impairment is one of the major limitations in optical cross-connect performance. We focus on rearrangeable matrices since they have lower complexity than their strict-sense nonblocking counterparts. Given the current high cost of optical SEs, the rearrangeable solution looks attractive today.

[1]  Tse-Yun Feng,et al.  On a Class of Multistage Interconnection Networks , 1980, IEEE Transactions on Computers.

[2]  Roberto Sabella,et al.  Optical path technologies: a comparison among different cross-connect architectures , 1996 .

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

[4]  Kyungsook Y. Lee.  On the Rearrangeability of 2(log2N) - 1 Stage Permutation Networks , 1985, IEEE Trans. Computers.

[5]  M. Burzio,et al.  Architectural analysis, feasibility study and first experimental results for a photonic ATM switching module , 1995 .

[6]  Arun N. Netravali,et al.  Dilated Networks for Photonic Switching , 1987, IEEE Trans. Commun..

[7]  Dharma P. Agrawal,et al.  Graph Theoretical Analysis and Design of Multistage Interconnection Networks , 1983, IEEE Transactions on Computers.

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

[9]  Chin-Tau A. Lea,et al.  Space-wavelength trade-off in the design of nonblocking directional-coupler-based networks under crosstalk constraint , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[10]  Chunming Qiao,et al.  Analysis of space-time tradeoffs in photonic switching networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[11]  D. C. Opferman,et al.  On a class of rearrangeable switching networks part I: Control algorithm , 1971 .

[12]  Joseph W. Goodman,et al.  Analysis of linear crosstalk in photonic crossbar switches based on on/off gates , 1996 .

[13]  M. Mehdi Vaez,et al.  Strictly and wide-sense nonblocking photonic switching systems under crosstalk constraint , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[14]  A. Mullin,et al.  Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .

[15]  Chin-Tau A. Lea,et al.  Tradeoff of horizontal decomposition versus vertical stacking in rearrangeable nonblocking networks , 1991, IEEE Trans. Commun..

[16]  Paul R. Prucnal,et al.  Optically processed self-routing, synchronization, and contention resolution for 1-D and 2-D photonic switching architectures , 1993 .

[17]  S. Andresen.  The Looping Algorithm Extended to Base 2tRearrangeable Switching Networks , 1977, IEEE Trans. Commun..

[18]  Achille Pattavina,et al.  Switching theory : architectures and performance in broadband ATM networks , 1998 .

[19]  Chin-Tau A. Lea,et al.  Multi-log2N networks and their applications in high-speed electronic and photonic switching systems , 1990, IEEE Trans. Commun..