Skip navigation
Skip navigation

Permutation Routing in All-Optical Product Networks

Liang, Weifa; Shen, Xiaojun


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.

CollectionsANU Research Publications
Date published: 2002
Type: Journal article
Source: IEEE Transactions on Circuits and Systems 1:FUNDAMENTAL THEORY AND APPLICATIONS
DOI: 10.1109/81.995673


There are no files associated with this item.

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator