Practical routing and wavelength assignment algorithms for all optical networks with limited wavelength conversion

Author

Swaminathan, M.D. ; Sivarajan, K.N.

Author_Institution

Indian Inst. of Sci., Bangalore, India

Volume

5

fYear

2002

fDate

2002

Firstpage

2750

Abstract

We present an integer linear program based algorithm and a K shortest path based heuristic algorithm for solving the routing and wavelength assignment problem in all optical networks with limited wavelength conversion. These algorithms are executed on a random mesh National Science Foundation Network (NSFNET). Their performances are compared.

Keywords

integer programming; linear programming; optical fibre networks; optical wavelength conversion; telecommunication network routing; wavelength division multiplexing; NSFNET; National Science Foundation Network; WDM networks; algorithms performance; all optical networks; integer linear program; random mesh network; routing algorithms; shortest path based heuristic algorithm; wavelength assignment algorithm; wavelength conversion; wavelength division multiplexing; All-optical networks; Communication industry; Heuristic algorithms; Network topology; Optical design; Optical wavelength conversion; Telecommunication traffic; Wavelength assignment; Wavelength conversion; Wavelength routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 2002. ICC 2002. IEEE International Conference on

Print_ISBN

0-7803-7400-2

Type

conf

DOI

10.1109/ICC.2002.997343

Filename

997343