### Abstract

This paper proposes a disjoint path selection scheme for generalized multiprotocol 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. In addition, since WSRLG searches for the weight of the SRLG factor by using a binary search algorithm while satisfying the required number of disjoint paths between source and destination nodes so that the cost of a path set can be minimized, it can find the most cost-effective disjoint paths.

Original language | English |
---|---|

Title of host publication | IEEE International Conference on High Performance Switching and Routing, HPSR |

Publisher | IEEE Computer Society |

Pages | 88-92 |

Number of pages | 5 |

ISBN (Print) | 488552184X, 9784885521843 |

DOIs | |

Publication status | Published - 2002 |

Externally published | Yes |

Event | 2002 Workshop on High Performance Switching and Routing: Merging Optical and IP Technologies, HPSR 2002 - Kobe, Japan Duration: 2002 May 26 → 2002 May 29 |

### Other

Other | 2002 Workshop on High Performance Switching and Routing: Merging Optical and IP Technologies, HPSR 2002 |
---|---|

Country | Japan |

City | Kobe |

Period | 02/5/26 → 02/5/29 |

### Fingerprint

### Keywords

- disjoint path
- GMPLS
- path selection algorithm
- SRLG

### ASJC Scopus subject areas

- Hardware and Architecture
- Electrical and Electronic Engineering

### Cite this

*IEEE International Conference on High Performance Switching and Routing, HPSR*(pp. 88-92). [1024214] IEEE Computer Society. https://doi.org/10.1109/HPSR.2002.1024214

**A disjoint path selection scheme with SRLG in GMPLS networks.** / Oki, E.; Matsuura, N.; Shiomoto, K.; Yamanaka, Naoaki.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*IEEE International Conference on High Performance Switching and Routing, HPSR.*, 1024214, IEEE Computer Society, pp. 88-92, 2002 Workshop on High Performance Switching and Routing: Merging Optical and IP Technologies, HPSR 2002, Kobe, Japan, 02/5/26. https://doi.org/10.1109/HPSR.2002.1024214

}

TY - GEN

T1 - A disjoint path selection scheme with SRLG in GMPLS networks

AU - Oki, E.

AU - Matsuura, N.

AU - Shiomoto, K.

AU - Yamanaka, Naoaki

PY - 2002

Y1 - 2002

N2 - This paper proposes a disjoint path selection scheme for generalized multiprotocol 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. In addition, since WSRLG searches for the weight of the SRLG factor by using a binary search algorithm while satisfying the required number of disjoint paths between source and destination nodes so that the cost of a path set can be minimized, it can find the most cost-effective disjoint paths.

AB - This paper proposes a disjoint path selection scheme for generalized multiprotocol 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. In addition, since WSRLG searches for the weight of the SRLG factor by using a binary search algorithm while satisfying the required number of disjoint paths between source and destination nodes so that the cost of a path set can be minimized, it can find the most cost-effective disjoint paths.

KW - disjoint path

KW - GMPLS

KW - path selection algorithm

KW - SRLG

UR - http://www.scopus.com/inward/record.url?scp=33750599601&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33750599601&partnerID=8YFLogxK

U2 - 10.1109/HPSR.2002.1024214

DO - 10.1109/HPSR.2002.1024214

M3 - Conference contribution

SN - 488552184X

SN - 9784885521843

SP - 88

EP - 92

BT - IEEE International Conference on High Performance Switching and Routing, HPSR

PB - IEEE Computer Society

ER -