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

Author

Oki, Eiji ; Matsuura, Nobuaki ; Shiomoto, Kohei ; Yamanaka, Naoaki

Author_Institution

Network Innovation Labs., NTT Corp., Tokyo, Japan

Volume

6

Issue

9

fYear

2002

Firstpage

406

Lastpage

408

Abstract

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.

Keywords

Internet; optical fibre networks; telecommunication network reliability; telecommunication network routing; telecommunication switching; GMPLS networks; Internet; SRLG constraints; WSRLG scheme; disjoint path selection scheme; generalized multi-protocol label switching networks; k-shortest path algorithm; optical networks; shared risk link groups; weighted-SRLG; Bandwidth; Costs; Electronic mail; Intelligent networks; Laboratories; Multiprotocol label switching; Network topology; Optical control; Optical fibers; Routing protocols;

fLanguage

English

Journal_Title

Communications Letters, IEEE

Publisher

ieee

ISSN

1089-7798

Type

jour

DOI

10.1109/LCOMM.2002.803477

Filename

1033207