Network models and routing algorithms for all-optical 3D grids

For the proposed all-optical 3D grids of directional couplers and Mach-Zehnder interferometers, network models (1) and (6) and their routing algorithms are reviewed and some are presented and discussed in more details. (1) Planar cellular arrays superposed by by-passing networks (2) 3D cellular arrays described by their projection onto Cayley graphs (3) shuffle networks (4) Clos networks (5) Projection onto 2D grids mapped onto hypercubes and onto star and pancake graphs and (6) Sorting in all-optical 3D grids. The extension to geometries N >= 5 and the introduction of wavelengths is briefly discussed.

[1]  J. Giglmayr.  All-optical multi-layer switching architectures: (I) M/spl times/N-gon prism switches , 1998, Proceedings 7th International Conference on Computer Communications and Networks (Cat. No.98EX226).

[2]  H. R. Ramanujam.  Decomposition of Permutation Networks , 1973, IEEE Transactions on Computers.

[3]  Josef Giglmayr.  Design principles of all-optical multilayer switches , 1999, Photonics West.

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

[5]  Suresh Chalasani,et al.  Nonblocking Operation of Asymmetrical Clos Networks , 1994, 1994 International Conference on Parallel Processing Vol. 1.

[6]  Josef Giglmayr.  3D grid architectures for all-optical switching , 1999, Photonics West.

[7]  Nobuji Saito,et al.  A Linear-Time Routing Algorithm for Convex Grids , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[8]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

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

[10]  Josef Giglmayr,et al.  Switch-setting algorithms for the optical N-gon prism switch , 1997, Other Conferences.