
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

A Disjoint Path Selection Scheme with Shared Risk Link Group Constraints in GMPLS Networks
Eiji OKI Nobuaki MATSUURA Kohei SHIOMOTO Naoaki YAMANAKA
Publication
IEICE TRANSACTIONS on Communications
Vol.E86B
No.8
pp.24552462 Publication Date: 2003/08/01
Online ISSN:
DOI:
Print ISSN: 09168516 Type of Manuscript: PAPER Category: Network Keyword: GMPLS, SRLG, disjoint path, path selection algorithm,
Full Text: PDF(947.1KB) >>Buy this Article
Summary:
This paper proposes a disjoint path selection scheme for Generalized MultiProtocol Label Switching (GMPLS) networks with Shared Risk Link Group (SRLG) constraints. It is called the weightedSRLG (WSRLG) scheme. It treats the total number of SRLG members related to a link as part of the link cost when the kshortest 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 kshortest path algorithm. In addition, since WSRLG searches for the weight of the SRLG factor by using a modified binary search algorithm while satisfying the required number of disjoint paths between source and destination nodes, it can find costeffective disjoint paths.

