Message Routing and Scheduling in Optical Multistage Networks Using Simulated Annealing
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
IEEE Transactions on Parallel and Distributed Systems
Multihop All-to-All Broadcast on WDM Optical Networks
IEEE Transactions on Parallel and Distributed Systems
Recent developments in optical multistage networks
Optical networks
A Methodology for Designing Efficient On-Chip Interconnects on Well-Behaved Communication Patterns
HPCA '03 Proceedings of the 9th International Symposium on High-Performance Computer Architecture
Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
A Design Methodology for Efficient Application-Specific On-Chip Interconnects
IEEE Transactions on Parallel and Distributed Systems
A Novel Multistage Network Architecture with Multicast and Broadcast Capability
The Journal of Supercomputing
A novel design of self-routing strictly nonblocking switching networks
International Journal of Computers and Applications
| Hi-index | 0.00 |
In many models of optical routing, to realize a routing request, one needs to find a set of communication paths in the network for the routing request and an assignment of wavelengths to the paths. Conventionally, to resolve the cross-talk problem on the optical fiber links, the wavelengths are assigned to the paths so that each path receive a single wavelength and the paths which receive the same wavelength are edge-disjoint. However, previous studies showed that the cross-talk problem also exists in the switches of the all-optical networks.To solve the cross-talk problem at both links and switches, one approach is to assign the wavelengths to the communication paths so that the paths, which receive the same wavelength, are node-disjoint. Our goal is to minimize the number of wavelengths required for permutation routings by node-disjoint paths on all-optical multistage interconnection networks (MINs) which consists of n stages of 2 times 2 switches connecting N=2n inputs and outputs. We prove that the problem of finding the minimum number of wavelengths for arbitrary partial permutation routings on the MINs is NP-complete.