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 language | English |
|---|---|
| Pages (from-to) | 406-408 |
| Number of pages | 3 |
| Journal | IEEE Communications Letters |
| Volume | 6 |
| Issue number | 9 |
| DOIs | |
| Publication status | Published - 2002 Sept |
| Externally published | Yes |
Keywords
- Disjoint path algorithm
- GMPLS
- SRLG
ASJC Scopus subject areas
- Modelling and Simulation
- Computer Science Applications
- Electrical and Electronic Engineering
Fingerprint
Dive into the research topics of 'A disjoint path selection scheme with shared risk link groups in GMPLS networks'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS