## 抄録

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.

本文言語 | English |
---|---|

ページ（範囲） | 2455-2462 |

ページ数 | 8 |

ジャーナル | IEICE Transactions on Communications |

巻 | E86-B |

号 | 8 |

出版ステータス | Published - 2003 8月 |

外部発表 | はい |

## ASJC Scopus subject areas

- ソフトウェア
- コンピュータ ネットワークおよび通信
- 電子工学および電気工学