A disjoint path selection scheme with SRLG in GMPLS networks

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

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

7 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 publicationHPSR 2002 - Workshop on High Performance Switching and Routing
Subtitle of host publicationMerging Optical and IP Technologies, Proceedings
PublisherIEEE Computer Society
Pages88-92
Number of pages5
ISBN (Print)488552184X, 9784885521843
DOIs
Publication statusPublished - 2002 Jan 1
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

Publication series

NameIEEE International Conference on High Performance Switching and Routing, HPSR
ISSN (Print)2325-5595
ISSN (Electronic)2325-5609

Other

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

Keywords

  • GMPLS
  • SRLG
  • disjoint path
  • path selection algorithm

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A disjoint path selection scheme with SRLG in GMPLS networks'. Together they form a unique fingerprint.

  • Cite this

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