Permutation routing in all-optical product networks

Weifa Liang; Xiaojun Shen

doi:10.1109/81.995673

Permutation routing in all-optical product networks

Weifa Liang^*, Xiaojun Shen

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	533-538
Number of pages	6
Journal	IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
Volume	49
Issue number	4
DOIs	https://doi.org/10.1109/81.995673
Publication status	Published - Apr 2002

Access to Document

10.1109/81.995673

Cite this

@article{94f58ab3f78243eaa24ba39036826f0f,

title = "Permutation routing in all-optical product networks",

abstract = "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.",

keywords = "Algorithm design and analysis, All-optical networks, Graph theory, Permutation routing, Product networks, Wavelength assignment",

author = "Weifa Liang and Xiaojun Shen",

year = "2002",

month = apr,

doi = "10.1109/81.995673",

language = "English",

volume = "49",

pages = "533--538",

journal = "IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications",

issn = "1057-7122",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "4",

}

TY - JOUR

T1 - Permutation routing in all-optical product networks

AU - Liang, Weifa

AU - Shen, Xiaojun

PY - 2002/4

Y1 - 2002/4

N2 - 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.

AB - 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.

KW - Algorithm design and analysis

KW - All-optical networks

KW - Graph theory

KW - Permutation routing

KW - Product networks

KW - Wavelength assignment

UR - http://www.scopus.com/inward/record.url?scp=0036540105&partnerID=8YFLogxK

U2 - 10.1109/81.995673

DO - 10.1109/81.995673

M3 - Article

SN - 1057-7122

VL - 49

SP - 533

EP - 538

JO - IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications

JF - IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications

IS - 4

ER -

Permutation routing in all-optical product networks

Abstract

Access to Document

Other files and links

Fingerprint

Cite this