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

被引：85

作者：

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

共 11 条

[1]

Banerjee A., 2001, IEEE COMMUNICATI JAN, P144

[2]

Bhandari R., 1999, SURVIVABLE NETWORKS

[3]

Dijkstra E. W., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390

[4] COMPARISON OF K-SHORTEST PATHS AND MAXIMUM FLOW ROUTING FOR NETWORK FACILITY RESTORATION [J].