Survivable networks based on optimal routing and WDM self-healing rings

被引:40
作者
Fumagalli, A [1 ]
Cerutti, I [1 ]
Tacca, M [1 ]
Masetti, F [1 ]
Jagannathan, R [1 ]
Alagar, S [1 ]
机构
[1] Univ Texas Dallas, Dallas, TX 75230 USA
来源
IEEE INFOCOM '99 - THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: THE FUTURE IS NOW | 1999年
关键词
D O I
10.1109/INFCOM.1999.751459
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The design of survivable all-optical networks based on self-healing WDM rings (SHR/WDM) to provide 100% protection from any single link failure requires the joint solution of three sub-problems. These are the Ring Cover of the mesh topology (the RC sub-problem), the routing of Working Lightpaths between node pairs to support traffic demands (the WL sub-problem) and the selection of the SHR/WDM Spare Wavelengths for the protection of every link traffic (the SW subproblem). This paper presents an ILP formulation of the problem of minimizing the total wavelength mileage (X-miles) required to support a set of given traffic demands in a given network topology using SHR/WDM employing 1:N line protection mechanism (the WRL problem). This formulation allows to jointly and optimally solve the three subproblems, and yields up to 15% reduction of the total X-miles required by existing solutions that separately resolve the sub-problems. A simplified sub-optimal solution of the WRL problem is also provided, that yields results few percent worse than the optimal solution and that is tractable for networks whose size is on the order of the Pan-European network, i.e., 19 nodes.
引用
收藏
页码:726 / 733
页数:8
相关论文
共 13 条
[1]  
ARMITAGE J, 1997, P IEEE INFOCOM 97, V1, P244
[2]  
BERKELAAR M, IPSOLVE2 2
[3]  
BERTHELON L, 1996, IEEE GLOBECOM 96
[4]  
BRACKETT CA, 1989, IEEE J SELECTED AREA, V8
[5]  
CHLAMTAC I, 1992, IEEE T COMM, V40
[6]  
GERSTEL O, 1997, P IEEE INFOCOM 97 AP, V1, P506
[7]  
GONDRAN M, 1979, GRAPHS ALGORITHMS
[8]  
JOHNSON D, 1996, IEEE GLOBECOM 96
[9]  
MUKHERJEE B, 1998, DIMACS WORKSH MULT O
[10]  
SHI J, 1995, IEEE ACM T NETWORKIN, V3