A tabu search heuristic for the routing and wavelength assignment problem in optical networks

被引:17
作者
Dzongang, C [1 ]
Galinier, P [1 ]
Pierre, S [1 ]
机构
[1] Ecole Polytech, Dept Comp Engn, Montreal, PQ H3C 3A7, Canada
关键词
heuristic algorithm; network design; routing and wavelength assignment; tabu search;
D O I
10.1109/LCOMM.2005.05011
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 [电子科学与技术];
摘要
This letter proposes a tabu search heuristic for solving the routing and wavelength assignment (RWA) problem in optical WDM networks, considering the wavelength continuity constraint and a given set of connections to satisfy. For a number of available wavelengths on each link, this algorithm attempts to maximize the number of routed connections. The algorithm has been implemented and tested on NSFNET and EONNET networks, and comparisons have been done with other algorithms in terms of the blocking rate. Generally, the results obtained with our tabu search heuristic are better than those provided by these algorithms.
引用
收藏
页码:426 / 428
页数:3
相关论文
共 7 条
[1]
Joint routing and wavelength assignment in wavelength division multiplexing networks for permanent and reliable paths [J].
Chamberland, S ;
Khyda, DO ;
Pierre, S .
COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (05) :1073-1087
[2]
CHAMOT SR, 2001, P SOC PHOTO-OPT INS, V2, P1
[3]
Algorithms for routing and wavelength assignment based on solutions of LP-relaxations [J].
Krishnaswamy, RM ;
Sivarajan, KN .
IEEE COMMUNICATIONS LETTERS, 2001, 5 (10) :435-437
[4]
Routing and wavelength assignment in optical networks from edge disjoint path algorithms [J].
Manohar, P ;
Manjunath, D ;
Shevgaonkar, RK .
IEEE COMMUNICATIONS LETTERS, 2002, 6 (05) :211-213
[5]
MODIANO E, 2001, OPT FIB COMM C EXH O, V2
[6]
Routing and wavelength assignment in optical networks [J].
Ozdaglar, AE ;
Bertsekas, DP .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2003, 11 (02) :259-272
[7]
ZHANG Y, 2002, P IEEE INT C COMM IC, V5, P2734