DocumentCode
1958284
Title
Algorithms for the diverse routing problem in WDM networks with shared risk link groups
Author
Pan, Xiaoshan ; Xiao, Gaoxi
Author_Institution
Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ.
fYear
2004
fDate
7-7 Sept. 2004
Firstpage
381
Lastpage
385
Abstract
In this paper, we study the heuristic algorithms for finding two paths that are not passing through any same shared risk link group (SRLG) between each pair of source-destination nodes. For this NP-complete problem, we design a heuristic algorithm which steadily outperforms the best existing algorithm in the first several iterations. When larger number of iterations is allowed, we show that several different algorithms manage to perform nearly the same, which provides some helpful insight into how to further improve the algorithm in the future
Keywords
iterative methods; optical fibre networks; optimisation; telecommunication network routing; wavelength division multiplexing; WDM network; diverse routing problem; heuristic algorithm; iteration method; optical fibre networks; shared risk link group; source-destination node; Algorithm design and analysis; Heuristic algorithms; Intelligent networks; NP-complete problem; Protection; Routing; Telecommunication traffic; Tiles; WDM networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications Systems, 2004. ICCS 2004. The Ninth International Conference on
Conference_Location
Singapore, China
Print_ISBN
0-7803-8549-7
Type
conf
DOI
10.1109/ICCS.2004.1359403
Filename
1359403
Link To Document