Adaptive techniques for routing and wavelength assignment in all-optical WANs

Author

Mokhtar, Ahmed ; Azizoglu, Murat

Author_Institution

Dept. of Electr. Eng., Washington Univ., Seattle, WA, USA

Volume

3

fYear

1996

fDate

18-21 Aug 1996

Firstpage

1195

Abstract

This paper considers routing and wavelength assignment issues in wavelength-routed all-optical networks. We use a general approach in which all paths connecting a source-destination pair are taken as candidate paths and the network state information is incorporated into the routing process. We formulate the optimal routing problem as an integer linear programming problem and show that it is computationally intractable. We then present adaptive routing and wavelength assignment algorithms and evaluate their blocking performance. Computational complexity of these algorithms is also analyzed. Simulation results are compared with analytical predictions of the call blocking probability

Keywords

computational complexity; integer programming; linear programming; optical fibre networks; probability; telecommunication network routing; telecommunication traffic; wavelength division multiplexing; wide area networks; adaptive routing algorithm; adaptive techniques; adaptive wavelength assignment algorithm; all-optical WAN; blocking performance; call blocking probability; computational complexity analysis; integer linear programming problem; network state information; optimal routing problem; source-destination pair; wavelength-routed optical networks; Algorithm design and analysis; All-optical networks; Analytical models; Computational complexity; Computational modeling; Integer linear programming; Joining processes; Predictive models; Wavelength assignment; Wavelength routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1996., IEEE 39th Midwest symposium on

Conference_Location

Ames, IA

Print_ISBN

0-7803-3636-4

Type

conf

DOI

10.1109/MWSCAS.1996.593086

Filename

593086