Routing Algorithm for a Circuit-switched Optical Extended Generalized Shuffle Network

Two key difficulties in the implementation and use of multistage interconnection networks have been the complexity of the network hardware and the complexity of the routing algorithm. This has been particularly evident in MIMD computing environments, when the network needs to support arbitrary interconnection pattern requests, and when no requests are to be buffered or postponed. Under the premise that the use of optics can at least partially alleviate the network hardware complexity issue, we consider in this paper the routing algorithm complexity needed to control such an optical network. We present a routing algorithm designed with the goal of minimal time complexity.