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 journalArticle

98 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 languageEnglish
Pages (from-to)406-408
Number of pages3
JournalIEEE Communications Letters
Volume6
Issue number9
DOIs
Publication statusPublished - 2002 Sep
Externally publishedYes

    Fingerprint

Keywords

  • Disjoint path algorithm
  • GMPLS
  • SRLG

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this