A disjoint path selection scheme with SRLG in GMPLS networks

E. Oki, N. Matsuura, K. Shiomoto, Naoaki Yamanaka

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

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 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. In addition, since WSRLG searches for the weight of the SRLG factor by using a binary search algorithm while satisfying the required number of disjoint paths between source and destination nodes so that the cost of a path set can be minimized, it can find the most cost-effective disjoint paths.

Original languageEnglish
Title of host publicationIEEE International Conference on High Performance Switching and Routing, HPSR
PublisherIEEE Computer Society
Pages88-92
Number of pages5
ISBN (Print)488552184X, 9784885521843
DOIs
Publication statusPublished - 2002
Externally publishedYes
Event2002 Workshop on High Performance Switching and Routing: Merging Optical and IP Technologies, HPSR 2002 - Kobe, Japan
Duration: 2002 May 262002 May 29

Other

Other2002 Workshop on High Performance Switching and Routing: Merging Optical and IP Technologies, HPSR 2002
CountryJapan
CityKobe
Period02/5/2602/5/29

Fingerprint

Switching networks
Labels
Costs

Keywords

  • disjoint path
  • GMPLS
  • path selection algorithm
  • SRLG

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Oki, E., Matsuura, N., Shiomoto, K., & Yamanaka, N. (2002). A disjoint path selection scheme with SRLG in GMPLS networks. In IEEE International Conference on High Performance Switching and Routing, HPSR (pp. 88-92). [1024214] IEEE Computer Society. https://doi.org/10.1109/HPSR.2002.1024214

A disjoint path selection scheme with SRLG in GMPLS networks. / Oki, E.; Matsuura, N.; Shiomoto, K.; Yamanaka, Naoaki.

IEEE International Conference on High Performance Switching and Routing, HPSR. IEEE Computer Society, 2002. p. 88-92 1024214.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Oki, E, Matsuura, N, Shiomoto, K & Yamanaka, N 2002, A disjoint path selection scheme with SRLG in GMPLS networks. in IEEE International Conference on High Performance Switching and Routing, HPSR., 1024214, IEEE Computer Society, pp. 88-92, 2002 Workshop on High Performance Switching and Routing: Merging Optical and IP Technologies, HPSR 2002, Kobe, Japan, 02/5/26. https://doi.org/10.1109/HPSR.2002.1024214
Oki E, Matsuura N, Shiomoto K, Yamanaka N. A disjoint path selection scheme with SRLG in GMPLS networks. In IEEE International Conference on High Performance Switching and Routing, HPSR. IEEE Computer Society. 2002. p. 88-92. 1024214 https://doi.org/10.1109/HPSR.2002.1024214
Oki, E. ; Matsuura, N. ; Shiomoto, K. ; Yamanaka, Naoaki. / A disjoint path selection scheme with SRLG in GMPLS networks. IEEE International Conference on High Performance Switching and Routing, HPSR. IEEE Computer Society, 2002. pp. 88-92
@inproceedings{d5dc6fb569874acb93a40efbe15f211c,
title = "A disjoint path selection scheme with SRLG in GMPLS networks",
abstract = "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 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. In addition, since WSRLG searches for the weight of the SRLG factor by using a binary search algorithm while satisfying the required number of disjoint paths between source and destination nodes so that the cost of a path set can be minimized, it can find the most cost-effective disjoint paths.",
keywords = "disjoint path, GMPLS, path selection algorithm, SRLG",
author = "E. Oki and N. Matsuura and K. Shiomoto and Naoaki Yamanaka",
year = "2002",
doi = "10.1109/HPSR.2002.1024214",
language = "English",
isbn = "488552184X",
pages = "88--92",
booktitle = "IEEE International Conference on High Performance Switching and Routing, HPSR",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - A disjoint path selection scheme with SRLG in GMPLS networks

AU - Oki, E.

AU - Matsuura, N.

AU - Shiomoto, K.

AU - Yamanaka, Naoaki

PY - 2002

Y1 - 2002

N2 - 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 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. In addition, since WSRLG searches for the weight of the SRLG factor by using a binary search algorithm while satisfying the required number of disjoint paths between source and destination nodes so that the cost of a path set can be minimized, it can find the most cost-effective disjoint paths.

AB - 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 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. In addition, since WSRLG searches for the weight of the SRLG factor by using a binary search algorithm while satisfying the required number of disjoint paths between source and destination nodes so that the cost of a path set can be minimized, it can find the most cost-effective disjoint paths.

KW - disjoint path

KW - GMPLS

KW - path selection algorithm

KW - SRLG

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

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

U2 - 10.1109/HPSR.2002.1024214

DO - 10.1109/HPSR.2002.1024214

M3 - Conference contribution

SN - 488552184X

SN - 9784885521843

SP - 88

EP - 92

BT - IEEE International Conference on High Performance Switching and Routing, HPSR

PB - IEEE Computer Society

ER -