论文信息 - A disjoint path selection scheme with shared risk link groups in GMPLS networks

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

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.

[1] Alon Itai,et al. The complexity of finding maximum disjoint paths with length constraints , 1982, Networks.

[2] John Moy,et al. OSPF Version 2 , 1998, RFC.

[3] Ayan Banerjee,et al. Generalized multiprotocol label switching: an overview of routing and management enhancements , 2001, IEEE Commun. Mag..

[4] Chung-Lun Li,et al. Finding disjoint paths with different path-costs: Complexity and algorithms , 1992, Networks.

[5] Eiji Oki,et al. Recursive matrix-calculation method for disjoint path search with hop link number constraints , 1995 .

[6] J. W. Suuballe,et al. Disjoint Paths in a Network , 2022 .

[7] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[8] Maurice Pollack,et al. SOLUTIONS OF THE SHORTEST-ROUTE PROBLEM-A REVIEW , 1960 .

[9] David R. Oran,et al. OSI IS-IS Intra-domain Routing Protocol , 1990, RFC.

[10] Wayne D. Grover,et al. Comparison of k-shortest paths and maximum flow routing for network facility restoration , 1994, IEEE J. Sel. Areas Commun..