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 language | English |
|---|---|
| Pages (from-to) | 2455-2462 |
| Number of pages | 8 |
| Journal | IEICE Transactions on Communications |
| Volume | E86-B |
| Issue number | 8 |
| Publication status | Published - 2003 Aug |
| Externally published | Yes |
Keywords
- Disjoint path
- GMPLS
- Path selection algorithm
- SRLG
ASJC Scopus subject areas
- Software
- Computer Networks and Communications
- Electrical and Electronic Engineering