Path-protection routing and wavelength assignment (RWA) in WDM mesh networks under duct-layer constraints

被引:108
作者
Zang, H [1 ]
Ou, C
Mukherjee, B
机构
[1] Sprint Adv Technol Labs, Burlingame, CA 94010 USA
[2] Univ Calif Davis, Dept Comp Sci, Davis, CA 95616 USA
基金
美国国家科学基金会;
关键词
integer linear program (ILP); lightpath; optical network; protection; shared risk link group; wavelength routing; wavelength-division multiplexing (WDM);
D O I
10.1109/TNET.2003.810313
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This study investigates the problem of fault management in a wavelength-division multiplexing (WDM)-based optical mesh network in which failures occur due to fiber cuts. In reality, bundles of fibers often get cut at the same time due to construction or destructive natural events, such as earthquakes. Fibers laid. down in the same duct have a significant probability to fail at the same time. When path protection is employed, we require the primary path and the backup path to be duct-disjoint, so that the, network is survivable under single-duct failures. Moreover, if two primary paths go through any common duct, their backup paths cannot share wavelengths on common links. This study addresses the routing and wavelength-assignment problem in a network with path protection under duct-layer constraints. Off-line algorithms for static traffic is developed to combat single-duct failures. The objective is to minimize total number of wavelengths used on all the links in the network. Both integer linear programs and a heuristic algorithm are presented and their performance is compared through numerical examples.
引用
收藏
页码:248 / 258
页数:11
相关论文
共 24 条
[1]  
[Anonymous], P IEEE ICC
[2]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[3]  
Datta S, 2001, GLOB TELECOMM CONF, P2104, DOI 10.1109/GLOCOM.2001.966152
[4]   Optical network design and restoration [J].
Doshi, BT ;
Dravida, S ;
Harshavardhana, P ;
Hauser, O ;
Wang, YF .
BELL LABS TECHNICAL JOURNAL, 1999, 4 (01) :58-84
[5]   COMPARISON OF K-SHORTEST PATHS AND MAXIMUM FLOW ROUTING FOR NETWORK FACILITY RESTORATION [J].
DUNN, DA ;
GROVER, WD ;
MACGREGOR, MH .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1994, 12 (01) :88-99
[6]  
ELLINAS G, 2003, SPIE OPTICAL NETWORK, V4, P91
[7]   Survivable networks based on optimal routing and WDM self-healing rings [J].
Fumagalli, A ;
Cerutti, I ;
Tacca, M ;
Masetti, F ;
Jagannathan, R ;
Alagar, S .
IEEE INFOCOM '99 - THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: THE FUTURE IS NOW, 1999, :726-733
[8]   Optical layer survivability - An implementation perspective [J].
Gerstel, O ;
Ramaswami, R .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2000, 18 (10) :1885-1899
[9]  
GERSTEL O, 1998, P OFC 98 SAN JOS CA, P269
[10]  
HO PH, 2002, P OPT FIB COMM C MAR