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

Eiji Oki, Nobuaki Matsuura, Kohei Shiomoto, Naoaki Yamanaka

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

This paper proposes a disjoint path selection scheme for Generalized Multi-Protocol Label Switching (GM-PLS) networks with Shared Risk Link Group (SRLG) constraints. It is called the weighted-SRLG (WSRLG) scheme. It treats the total 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 modified binary search algorithm while satisfying the required number of disjoint paths between source and destination nodes, it can find cost-effective disjoint paths.

Original languageEnglish
Pages (from-to)2455-2462
Number of pages8
JournalIEICE Transactions on Communications
VolumeE86-B
Issue number8
Publication statusPublished - 2003 Aug
Externally publishedYes

Keywords

  • Disjoint path
  • GMPLS
  • Path selection algorithm
  • SRLG

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

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

  • Cite this