抄録
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.
| 本文言語 | English |
|---|---|
| ページ（範囲） | 406-408 |
| ページ数 | 3 |
| ジャーナル | IEEE Communications Letters |
| 巻 | 6 |
| 号 | 9 |
| DOI | |
| 出版ステータス | Published - 2002 9月 |
| 外部発表 | はい |
ASJC Scopus subject areas
- モデリングとシミュレーション
- コンピュータ サイエンスの応用
- 電子工学および電気工学