DocumentCode
1272529
Title
Permutation routing in all-optical product networks
Author
Liang, Weifa ; Shen, Xiaojun
Author_Institution
Dept. of Comput. Sci., Australian Nat. Univ., Canberra, ACT, Australia
Volume
49
Issue
4
fYear
2002
fDate
4/1/2002 12:00:00 AM
Firstpage
533
Lastpage
538
Abstract
In this work, 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
Keywords
directed graphs; optical fibre networks; optical wavelength conversion; telecommunication network routing; wavelength division multiplexing; WDM; all-optical product network; directed symmetric graph; fiber-optic link; graph theory; lower bound; number of wavelengths; packet-passing model; permutation routing; routing algorithms; wavelength assignment; wavelength conversion models; wavelength nonconversion models; Asymptotic stability; Automatic control; Circuits; Communication system control; Eigenvalues and eigenfunctions; Fiber lasers; Intelligent networks; Laser beams; Laser theory; Routing;
fLanguage
English
Journal_Title
Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on
Publisher
ieee
ISSN
1057-7122
Type
jour
DOI
10.1109/81.995673
Filename
995673
Link To Document