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

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

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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE communications letters 2002-09, Vol.6 (9), p.406-408
Hauptverfasser: Oki, E., Matsuura, N., Shiomoto, K., Yamanaka, N.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Applied sciences
Bandwidth
Computer networks
Costs
Electronic mail
Exact sciences and technology
Intelligent networks
Laboratories
Links
Multiprotocol label switching
Network topology
Networks
Optical control
Optical fibers
Risk
Routing protocols
Shortest-path problems
Switching
Switching theory
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Teletraffic
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2002.803477