Failure protection in layered networks with shared risk link groups

被引：44
作者：
Xu, DH [1 ]
Xiang, YZ [1 ]
Oiao, CM [1 ]
Li, GZ [1 ]
机构：
[1] SUNY Buffalo, Dept Comp Engn & Sci, Buffalo, NY 14260 USA
来源：
IEEE NETWORK | 2004年 / 18卷 / 03期
关键词：
D O I：
10.1109/MNET.2004.1301021
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The shared risk link group (SRLG) has been widely recognized as a fundamental concept in layered network design by the industry. However, several issues related to SRLG protection that are of both theoretical interest and practical importance have not been explored fully. Two major issues are avoiding failures caused by "traps" in finding backup paths, and minimizing the total network capacity requested by active and backup paths. In this article, we highlight the significance of the trap problem in layered networks with SRLG and evaluate the performance of several existing SRLG protection schemes in terms of trap avoidance and bandwidth efficiency, as well as their complexities. We also demonstrate that a simple yet intelligent heuristic algorithm can achieve good performance.
引用
收藏
页码：36 / 41
页数：6
相关论文
共 18 条
[1]  
BHANDARI R, 1994, INFOCOM 94
[2]  
Bouillet E, 2002, IEEE INFOCOM SER, P801, DOI 10.1109/INFCOM.2002.1019326
[3]  
BOUILLET E, 2002, 7 EUR C NETW OPT COM
[4]   Capacity design studies of span-restorable mesh transport networks with shared-risk link group (SRLG) effects [J].
Doucette, J ;
Grover, WD .
OPTICOMM 2002: OPTICAL NETWORKING AND COMMUNICATIONS, 2002, 4874 :25-38
[5]  
Ellinas G., 2003, Optical Networks Magazine, V4, P91
[6]   Diverse routing in optical mesh networks [J].
Hu, JQ .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2003, 51 (03) :489-494
[7]  
Kodialam M., 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), P902, DOI 10.1109/INFCOM.2000.832265
[8]   FINDING DISJOINT PATHS WITH DIFFERENT PATH-COSTS - COMPLEXITY AND ALGORITHMS [J].
LI, CL ;
MCCORMICK, ST ;
SIMCHILEVI, D .
NETWORKS, 1992, 22 (07) :653-667
[9]  
LI G, 2002, OPT NET MAG MAY, V3
[10]  
Liu Y, 2001, GLOB TELECOMM CONF, P2093, DOI 10.1109/GLOCOM.2001.966150
12