Permutation Routing in All-Optical Product Networks
In this brief, we study the permutation routing for an all-optical product network. We show a lower bound on the number of wavelengths needed to implement any permutation with one round. We also present efficient routing algorithms for two models, the wavelength non-conversion and conversion models, respectively.
|Collections||ANU Research Publications|
|Source:||IEEE Transactions on Circuits and Systems 1:FUNDAMENTAL THEORY AND APPLICATIONS|