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

Eiji Oki; Nobuaki Matsuura; Kohei Shiomoto; Naoaki Yamanaka

doi:10.1109/LCOMM.2002.803477

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

Eiji Oki, Nobuaki Matsuura, Kohei Shiomoto, Naoaki Yamanaka

Research output: Contribution to journal › Article › peer-review

84 Citations (Scopus)

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.

Original language	English
Pages (from-to)	406-408
Number of pages	3
Journal	IEEE Communications Letters
Volume	6
Issue number	9
DOIs	https://doi.org/10.1109/LCOMM.2002.803477
Publication status	Published - 2002 Sept
Externally published	Yes

Keywords

Disjoint path algorithm
GMPLS
SRLG

ASJC Scopus subject areas

Modelling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/LCOMM.2002.803477

Cite this

@article{fc537de34b834afca9281d3316b2cb19,

title = "A disjoint path selection scheme with shared risk link groups in GMPLS networks",

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 = "Disjoint path algorithm, GMPLS, SRLG",

author = "Eiji Oki and Nobuaki Matsuura and Kohei Shiomoto and Naoaki Yamanaka",

year = "2002",

month = sep,

doi = "10.1109/LCOMM.2002.803477",

language = "English",

volume = "6",

pages = "406--408",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "9",

}

TY - JOUR

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

AU - Oki, Eiji

AU - Matsuura, Nobuaki

AU - Shiomoto, Kohei

AU - Yamanaka, Naoaki

PY - 2002/9

Y1 - 2002/9

N2 - 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.

AB - 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.

KW - Disjoint path algorithm

KW - GMPLS

KW - SRLG

UR - http://www.scopus.com/inward/record.url?scp=0036749418&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036749418&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2002.803477

DO - 10.1109/LCOMM.2002.803477

M3 - Article

AN - SCOPUS:0036749418

SN - 1089-7798

VL - 6

SP - 406

EP - 408

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 9

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this