Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
