2002年
A disjoint path selection scheme with SRLG in GMPLS networks
HPSR 2002: WORKSHOP ON HIGH PERFORMANCE SWITCHING AND ROUTING, PROCEEDINGS
- ,
- ,
- ,
- 巻
- May 2002
- 号
- 開始ページ
- 88
- 終了ページ
- 92
- 記述言語
- 英語
- 掲載種別
- 研究論文(国際会議プロシーディングス)
- DOI
- 10.1109/HPSR.2002.1024214
- 出版者・発行元
- DENSHI JOHO TSUSHIN GAKKAI KIKAI SHINKO KAIKAN
This paper 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. 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.
- リンク情報
- ID情報
-
- DOI : 10.1109/HPSR.2002.1024214
- Web of Science ID : WOS:000177783100015