Parallel routing and wavelength assignment for optical multistage interconnection networks

Multistage interconnection networks (MINs) are among the most efficient switching architectures in terms of the number of switching elements (SEs) used. For op-tical MINs (OMINs), two I/O connections with neigh-boring wavelengths cannot share a common SE due to crosstalk. In this paper, we focus on the wavelength di-lation approach, in which the I/O connections shar-ing a common SE will be assigned different wavelengths with enough wavelength spacing. We first study the per-mutation capacity of OMINs, then propose fast par-allel routing and wavelength assignment algorithms for OMINs. By applying our permutation decomposi-tion and graph coloring techniques, the proposed algo-rithms can route any permutation without crosstalk in wavelength-rearrangeable space-strict-sense Banyan net-works and wavelength-rearrangeable space-rearrangeable Benes networks in polylogarithmic time using a linear num-ber of processors. 1

Upper Bound Analysis and Routing in Optical Benes Networks

Multistage Interconnection Networks (MIN) are popular in switching and communication applications. It has been used in telecommunication and parallel computing systems for many years. The new challenge facing optical MIN is crosstalk, which is caused by coupling two signals within a switching element. Crosstalk is not too big an issue in the Electrical Domain, but due to the stringent Bit Error Rate (BER) constraint, it is a big major concern in the Optical Domain. In this research dissertation, we will study the blocking probability in the optical network and we will study the deterministic conditions for strictly non-blocking Vertical Stacked Optical Benes Networks (VSOBN) with and without worst-case scenarios. We will establish the upper bound on blocking probability of Vertical Stacked Optical Benes Networks with respect to the number of planes used when the non-blocking requirement is not met. We will then study routing in WDM Benes networks and propose a new routing algorithm so that the number of wavelengths can be reduced. Since routing in WDM optical network is an NP-hard problem, many heuristic algorithms are designed by many researchers to perform this routing. We will also develop a genetic algorithm, simulated annealing algorithm and ant colony technique and apply these AI algorithms to route the connections in WDM Benes network