Efficient protocols for permutation routing on all-optical multistage interconnection networks

To realize a routing request R on a WDM (wavelength division multiplexing) all-optical network, one needs to set up routing paths in the network for every input-output pair in R and to assign a wavelength to each path so that the paths with the same wavelength are edge-disjoint. The optical bandwidth of the WDM all-optical network is the number of wavelengths supported by each link of the network. If the number of wavelengths for realizing R is at most the bandwidth of the network then R can be routed in one round of routing. However, when the number of wavelengths needed is beyond the bandwidth, multiple rounds of routing are required. In this case, it is important to minimize the number of rounds of routing. We give two deterministic algorithms for permutation routings on the parallel computing systems connected by all-optical multistage interconnection networks (MINs). For the parallel computing systems with practical size, the first algorithm realizes any permutation in two rounds of routing. The second algorithm realizes any bit-permute-complement (BPC) permutation on the n-dimensional MINs in two rounds of routing.

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

[2]  Hisao Tamaki,et al.  Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths , 1997, J. Parallel Distributed Comput..

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

[4]  Hisao Tamaki,et al.  Multi-Color Routing in the Undirected Hypercube , 1997, ISAAC.

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

[6]  Rajiv Ramaswami,et al.  Multiwavelength optical networks with limited wavelength conversion , 1998, TNET.

[7]  Leslie G. Valiant,et al.  A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[8]  Hisao Tamaki,et al.  Multicolor routing in the undirected hypercube , 2000, Discret. Appl. Math..

[9]  Franco Chiaraluce,et al.  Wavelength Division Multiple Access Optical Networks , 1998 .

[10]  Shietung Peng,et al.  Wavelengths requirement for permutation routing in all-optical multistage interconnection networks , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[11]  Jacques Lenfant,et al.  Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations , 1978, IEEE Transactions on Computers.

[12]  Amit Kumar,et al.  Wavelength conversion in optical networks , 1999, SODA '99.

[13]  Abraham Waksman,et al.  A Permutation Network , 1968, JACM.

[14]  Yi Pan,et al.  Permutation Capability of Optical Multistage Interconnection Networks , 2000, J. Parallel Distributed Comput..

[15]  Lata Narayanan,et al.  All-to-all optical routing in optimal chordal rings of degree four , 1999, SODA '99.

[16]  Kumar N. Sivarajan,et al.  Optical Networks: A Practical Perspective , 1998 .

[17]  Robert G. Gallager,et al.  Wavelength requirements of all-optical networks , 1995, TNET.

[18]  Satish Rao,et al.  Efficient access to optical bandwidth , 1995, FOCS 1995.

[19]  Nobuhiko Koike.  NEC Cenju-3: a microprocessor-based parallel computer , 1994, Proceedings of 8th International Parallel Processing Symposium.

[20]  Ahmed Mokhtar,et al.  Adaptive wavelength routing in all-optical networks , 1998, TNET.

[21]  Friedhelm Meyer auf der Heide,et al.  Randomized protocols for low-congestion circuit routing in multistage interconnection networks , 1998, STOC '98.

[22]  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.

[23]  Peter Winkler,et al.  Ring routing and wavelength translation , 1998, SODA '98.

[24]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[25]  Dharma P. Agrawal,et al.  Bounds on the number of passes in multistage interconnection networks , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[26]  P. Green.  Fiber Optic Networks , 1992 .

[27]  Alexander Russell,et al.  A Note on Optical Routing on Trees , 1997, Inf. Process. Lett..

[28]  Douglas Stott Parker,et al.  Notes on Shuffle/Exchange-Type Switching Networks , 1980, IEEE Transactions on Computers.