A crosstalk free routing algorithm of optical Multistage Interconnection Networks

Crosstalk is an intrinsic drawback of optical networks and avoiding crosstalk is important for making fruitful application of optical switching networks. Rearrangeable optical Multistage Interconnection Networks (MINs) are feasible since they have lower complexity than their strictly counterparts. In this paper, we propose a crosstalk free routing algorithm of optical MINs and we apply it to three examples of optical MINs, the Generalized Recursive Network (GRN), the Banyan Network and the Benes Network. The routing algorithm is derived based on the idea of the semi-permutation and it completes the decomposition of a permutation.