Dynamic routing and assignment of wavelength algorithms in multi-fiber wavelength division multiplexing networks

Author

Xu, Shizhong ; Li, Lemin ; Wang, Sheng

Author_Institution

Key Lab. of Opt. Commun., Univ. of Electron. Sci. & Technol. of China, Chengdu, China

fYear

1999

fDate

1999

Firstpage

332

Lastpage

337

Abstract

Two algorithms are proposed for the dynamic routing and assignment of wavelength problem in multi-fiber wavelength division multiplexing all-optical networks. By virtue of the layered graph, the routing and assignment of wavelength subproblems can be considered simultaneously. Simulation shows that layered-graph-based RAW algorithms perform better than the existing ones. Making use of the special structure of the layered graph, we propose a shortest path algorithm, whose complexity is lower than that of the standard shortest path algorithms

Keywords

graph theory; network topology; optical fibre networks; telecommunication network routing; wavelength division multiplexing; RAW algorithms; complexity; dynamic routing; layered graph; multi-fiber networks; performance; shortest path algorithm; simulation; wavelength assignment; wavelength division multiplexing; All-optical networks; Intelligent networks; Measurement; Optical fiber cables; Optical switches; Optical wavelength conversion; Telecommunication traffic; Wavelength assignment; Wavelength division multiplexing; Wavelength routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Communications and Networks, 1999. Proceedings. Eight International Conference on

Conference_Location

Boston, MA

ISSN

1095-2055

Print_ISBN

0-7803-5794-9

Type

conf

DOI

10.1109/ICCCN.1999.805539

Filename

805539