Switch-setting algorithms for the optical N-gon prism switch

The optical N-gon prism switch is the simplest multi-layer architecture and a starting point for novel all-optical switching architectures. The N-gon prism switch is composed of parallel waveguides at each layer; switching between the waveguides at each layer and switching between the waveguides at adjacent layers is assumed, and the optics comes in by the transmission of light through the waveguides. Throughout the paper, switch setting algorithms for the N-gon prism switch are discussed where (1) an approach to an algebraic and scalable algorithm is presented for its fast implementation and (2) the further development of the multi-layer switching concept is taken into account.

[1]  Miguel Angel Fiol,et al.  Line digraph iterations and the (d,k) problem for directed graphs , 1983, ISCA '83.

[2]  Karl N. Levitt,et al.  Cellular Interconnection Arrays , 1968, IEEE Transactions on Computers.

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

[4]  R A Spanke,et al.  N-stage planar optical permutation network. , 1987, Applied optics.

[5]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[6]  Gunnar E. Carlsson,et al.  Interconnection Networks Based on a Generalization of Cube-Connected Cycles , 1985, IEEE Transactions on Computers.

[7]  Josef Giglmayr.  Kautz topologies for all-optical self-routing networks , 1995, Other Conferences.

[8]  A. Yavuz Oruç,et al.  A nonbacktracking matrix decomposition algorithm for routing on Clos networks , 1993, IEEE Trans. Commun..

[9]  Chita R. Das,et al.  A task-based dependability model for k-ary n-cubes , 1996, Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing.

[10]  A. Yavuz Oruç,et al.  Programming Cellular Permutation Networks Through Decomposition of Symmetric Groups , 1987, IEEE Transactions on Computers.

[11]  M. Paull.  Reswitching of connection networks , 1962 .

[12]  Josef Giglmayr.  Self-routing in multistage networks based on nearest-neighbor interconnects , 1993, Optics & Photonics.

[13]  Josef Giglmayr.  Novel all-optical planar and compact minimum-stage switches of size >= 4x4 , 1997, Optics East.

[14]  F. Harary,et al.  A survey of the theory of hypercube graphs , 1988 .

[15]  R. J. Reason.  Optical space switch architectures based upon lithium niobate crosspoints , 1989 .

[16]  A. Yavuz Oruç,et al.  Routing Algorithms for Cellular Interconnection Arrays , 1984, IEEE Transactions on Computers.

[17]  J. E. Watson,et al.  Coupling of intersecting Ti:LiNbO3 diffused waveguides. , 1984, Applied optics.

[18]  Josef Giglmayr,et al.  New Directions in Modelling, Analysis and Design of WDM/OFDM-Networks: (I) Optical Switching , 1997, ONDM.

[19]  Chita R. Das,et al.  Modeling virtual channel flow control in hypercubes , 1995, Proceedings of 1995 1st IEEE Symposium on High Performance Computer Architecture.

[20]  Josef Giglmayr.  WDM/OFDM networks: transformations, embeddings, and dualism , 1996, Other Conferences.

[21]  Josef Giglmayr.  Sorting on a ≧ 2-D Multistage Architecture with Nearest-Neighbour Interconnection of Switches , 1996 .

[22]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[23]  Satoru Okamoto,et al.  Self-routing planar network for guided-wave optical switching systems , 1990 .