Fiber span failure protection in mesh optical networks

被引:12
作者
Li, GZ [1 ]
Doverspike, B [1 ]
Kalmanek, C [1 ]
机构
[1] AT&T Shannon Labs, Skiplinehalf AT&T Labs, Res, Florham Pk, NJ 07932 USA
来源
OPTICOMM 2001: OPTICAL NETWORKING AND COMMUNICATIONS | 2001年 / 4599卷
关键词
Spare capacity allocation; Fiber span protection; Mesh restoration; Heuristic algorithms;
D O I
10.1117/12.436053
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A major challenge of optical network design is deciding where spare capacity is needed and how much, so that interrupted traffic may be rerouted in the event of a failure. Given the optical network topology and traffic forecast, the network design needs to map the traffic forecast into optical connection demands. For each optical connection demand, two paths need to be computed, i.e., a service path and a restoration path. In most cases, optical network design mainly considers single failure. If two service paths do not share any single failure, their restoration paths can share the same capacity on any links that they have in common. In this way, the total spare capacity needed for restoration can be dramatically reduced. However, due to the layered architecture in optical networks, a pair of diverse paths in a particular layer won't necessarily be diverse when the lower layer topology is considered. For example, optical networks are typically built on top of a network of fiber spans. A single span cut in the fiber network can cause multiple link failures in the optical layer. In this paper, we investigate fiber span failure protection scenarios in mesh optical networks. Specifically, we provide an algorithm to find two fiber span disjoint paths for each demand, such that the total spare capacity allocated in the network is minimized. Another problem that arises in restoration path computation is the existence of a trap topology. In a trap topology, the pre-selected service path may not have a diverse restoration path even though two diverse paths exist in the network. For simple link-disjoint protection, the min-cost max-flow algorithm can be used to avoid this problem. For fiber span failure protection, the trap topology problem becomes complicated. We show that it is NP-hard problem to find the maximum number of fiber-span disjoint paths between two nodes. We provide two heuristic algorithms to solve this trap topology problem. We have implemented fiber span failure protection in our restoration capacity planning toolkit Cplan. We describe an application of fiber span failure protection at the end of the paper.
引用
收藏
页码:130 / 141
页数:12
相关论文
共 25 条
[1]  
[Anonymous], 1979, GRAPHS NETWORKS
[2]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[3]  
Bhandari R., 1999, SURVIVABLE NETWORKS
[4]  
CAENEGEM BV, 1998, IEEE J SEL AREA COMM, V16, P1146
[5]  
DOVERSPIKE R, 2000, IEEE INFOCOM 00
[6]  
DOVERSPKE R, 2000, IEEE COMMUNICATI FEB
[7]  
DUNNETT SB, 1994, ADV NEUROSC, V2, P1
[8]   Fast optimization of survivable WDM mesh networks based on multiple self-healing rings [J].
Fumagalli, A ;
Valcarenghi, L .
ALL-OPTICAL NETWORKING 1999: ARCHITECTURE, CONTROL, AND MANAGEMENT ISSUES, 1999, 3843 :44-55
[9]  
GROVER WD, 1987, IEEE GLOB C COMM, P1090
[10]  
GROVER WD, 1999, TELECOMMUNICATION NE, P169