Reconfiguration algorithms based on meta-heuristics for multihop WDM lightwave networks

Author

Kato, Manabu ; Oie, Yuji

Author_Institution

Dept. of Electron. & Inf. Eng., Ariake Nat. Coll. of Technol., Japan

Volume

3

fYear

2000

fDate

2000

Firstpage

1638

Abstract

The logical configuration of a WDM network can be changed by reassigning wavelengths to tunable transceivers of nodes. In this paper, we develop reconfiguration algorithms to obtain an optimal node placement of multihop networks with regular topology. The algorithms are based on meta-heuristics such as simulated annealing, threshold acceptance, and multistart local search. We compare the performance of these algorithms in terms of their calculation time required to reach a solution with accuracy of some given degree

Keywords

network topology; optical fibre networks; search problems; simulated annealing; transceivers; wavelength division multiplexing; WDM networks; meta-heuristics; multihop lightwave networks; multistart local search; optimal node placement; reconfiguration algorithms; regular topology; simulated annealing; threshold acceptance; tunable transceivers; wavelength reassignment; Heuristic algorithms; Routing; Simulated annealing; Spread spectrum communication; Telecommunication traffic; Transceivers; Transmitters; Tunable circuits and devices; WDM networks; Wavelength division multiplexing;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 2000. ICC 2000. 2000 IEEE International Conference on

Conference_Location

New Orleans, LA

Print_ISBN

0-7803-6283-7

Type

conf

DOI

10.1109/ICC.2000.853772

Filename

853772