A disjoint path selection scheme with shared risk link groups in GMPLS networks

被引：83
|
作者：
Oki, E [1 ]
Matsuura, N
Shiomoto, K
Yamanaka, N
机构：
[1] NTT Network Innovat Labs, Tokyo 1808585, Japan
[2] NTT Network Serv Syst Labs, Tokyo 1808585, Japan
来源：
IEEE COMMUNICATIONS LETTERS | 2002年 / 6卷 / 09期
关键词：
disjoint path algorithm; GMPLS; SRLG;
D O I：
10.1109/LCOMM.2002.803477
中图分类号：
TN [电子技术、通信技术];
学科分类号：
0809 ;
摘要：
This letter proposes a disjoint path selection scheme for generalized multi-protocol label switching (GMPLS) networks with shared risk link group (SRLG) constraints. It is called the weighted-SRLG (WSRLG) scheme. It treats the number of SRLG members related to a link as part of the link cost when the k-shortest path algorithm is executed. In WSRLG, a link that has many SRLG members is rarely selected as the shortest path. Simulation results show that WSRLG finds more disjoint paths than the conventional k-shortest path algorithm.
引用
收藏
页码：406 / 408
页数：3
相关论文
共 50 条
  • [41] Dynamic integrated path-protection algorithms in IP over WDM networks under shared-risk-link-groups constraints
    He, RX
    Li, LM
    Sheng, W
    APOC 2002: ASIA-PACIFIC OPTICAL AND WIRELESS COMMUNICATIONS; OPTICAL NETWORKING II, 2002, 4910 : 283 - 291
  • [42] Quick survivable algorithm with shared-risk link groups in backup-shared restorable optical networks
    Guo, Lei
    Li, Lemin
    Cao, Jin
    Yu, Hongfang
    OPTICAL ENGINEERING, 2007, 46 (04)
  • [43] New SRLG-diverse path selection algorithm in survivable GMPLS networks
    Wang Yan
    Zheng Junhui
    Zeng Jiazhi
    JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2009, 20 (02) : 412 - 419
  • [44] New SRLG-diverse path selection algorithm in survivable GMPLS networks
    Wang Yan1
    Chengdu 610054
    2. Coll. of Computer Science and Technology
    JournalofSystemsEngineeringandElectronics, 2009, 20 (02) : 412 - 419
  • [45] Diverse Routing Based on Shared Risk Link Groups
    Kiese, Moritz
    Marcheva, Velislava
    Eberspaecher, Joerg
    Schupke, Dominic
    2009 7TH INTERNATIONAL WORKSHOP ON THE DESIGN OF RELIABLE COMMUNICATION NETWORKS (DRCN 2009), 2009, : 153 - +
  • [46] Bidirectional path setup scheme using on upstream label set in optical GMPLS networks
    Oki, E
    Matsuura, N
    Shiomoto, K
    Yamanaka, N
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2004, E87B (06) : 1569 - 1576
  • [47] Calculating a maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks
    Gomes, Teresa
    Jorge, Luisa
    Melo, Paulo
    Girao-Silva, Rita
    Mendes, Sergio
    2013 9TH INTERNATIONAL CONFERENCE ON THE DESIGN OF RELIABLE COMMUNICATION NETWORKS (DRCN), 2013, : 314 - 321
  • [48] ConSet: Hierarchical concurrent path setup scheme in multi-layer GMPLS networks
    Oki, E
    Shimazaki, D
    Shiomoto, K
    Yamanaka, N
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2004, E87B (10) : 3107 - 3110
  • [49] p-cycle design in survivable WDM networks with shared risk link groups (SRLGs)
    Chang, L
    Lu, RA
    PHOTONIC NETWORK COMMUNICATIONS, 2006, 11 (03) : 301 - 311
  • [50] p-Cycle design in survivable WDM networks with shared risk link groups (SRLGs)
    Liu, C
    Ruan, L
    5TH INTERNATIONAL WORKSHOP ON DESIGN OF RELIABLE COMMUNICATION NETWORKS, PROCEEDINGS: RELIABLE NETWORKS FOR RELIABLE SERVICES, 2005, : 207 - 212
12345