The preplanned weighted restoration scheme

被引:7
作者
Fumagalli, A [1 ]
Valcarenghi, L [1 ]
机构
[1] Univ Texas, Erik Jonsson Sch Engn & Comp Sci, Opt Networking Adv Res OPNEAR Lab, Richardson, TX USA
来源
2001 IEEE WORKSHOP ON HIGH PERFORMANCE SWITCHING AND ROUTING | 2001年
关键词
D O I
10.1109/HPSR.2001.923600
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
One of the expected benefits of Wavelength Division Multiplexing (WDM) is the possibility to provide an optical layer (OL) with built-in capabilities to survive to network component faults, e.g., fiber cut. Several schemes exist to design a reliable OL. These schemes are generally divided into protection and restoration techniques. Protection schemes reserve in advance a dedicated backup path and a wavelength that are readily available upon disruption of the working path. Restoration schemes, on the contrary, dynamically look for backup paths of spare wavelengths upon failure occurrence. While protection schemes have been extensively used in the telephone industry for many years due to their prompt reaction to faults, restoration schemes are preferred candidates for the OL as, in principle, they yield more efficient and flexible resource reservation. The latter schemes, however, typically require a relatively long time to be completed due to the heavy signalling that originates upon network failure. In high capacity WDM networks, the presence of many connections concurrently seeking restoration exacerbates the above problem as, in existing restoration schemes, coordination among restoration attempts may further slow down the process completion. The authors propose a fast and efficient path restoration scheme called Preplanned Weighted Restoration (PWR). In the PWR scheme distinct restoration paths are precomputed at the source node during the connection setup. Upon failure, one of the preplanned paths is randomly selected depending on specific weights precalculated by the source node. The proposed scheme requires limited signaling upon failure occurrence as coordination among the source nodes involved in the restoration process is not required. Therefore, the scheme is fast and scalable in terms of number of network nodes,link or fiber capacity, and number of connections. Yet, presented results show that the PWR scheme may considerably decrease the blocking probability of the restoration attempts when compared to other schemes such as the alternate routing.
引用
收藏
页码:36 / 41
页数:6
相关论文
共 12 条
[1]  
AIDAROUS S, 1994, TELECOMMUNICATIONS N, P337
[2]   Multiprotocol lambda switching: Combining MPLS traffic engineering control with optical crossconnects [J].
Awduche, D ;
Rekhter, Y .
IEEE COMMUNICATIONS MAGAZINE, 2001, 39 (03) :111-116
[3]  
Banerjee A, 2001, IEEE COMMUN MAG, V39, P144, DOI 10.1109/35.894389
[4]  
CHEN TM, 2000, P SPIE NOV 6 8
[5]   USING DISTRIBUTED TOPOLOGY UPDATE AND PREPLANNED CONFIGURATIONS TO ACHIEVE TRUNK NETWORK SURVIVABILITY [J].
COAN, BA ;
LELAND, WE ;
VECCHI, MP ;
WEINRIB, A ;
WU, LT .
IEEE TRANSACTIONS ON RELIABILITY, 1991, 40 (04) :404-416
[6]   Challenges for MPLS in optical network restoration [J].
Doverspike, R ;
Yates, J .
IEEE COMMUNICATIONS MAGAZINE, 2001, 39 (02) :89-96
[7]  
Fumagalli A, 2000, IEEE NETWORK, V14, P34, DOI 10.1109/65.885668
[8]   A highly efficient path-restoration protocol for management of optical network transport integrity [J].
Iraschko, RR ;
Grover, WD .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2000, 18 (05) :779-794
[9]   WDM optical communication networks: Progress and challenges [J].
Mukherjee, B .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2000, 18 (10) :1810-1824
[10]  
OH H, 2000, IEEE GLOB TEL C 2000, V3, P1731