A disjoint path selection scheme with SRLG in GMPLS networks

E. Oki, N. Matsuura, K. Shiomoto, N. Yamanaka

研究成果: Conference contribution

7 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルHPSR 2002 - Workshop on High Performance Switching and Routing
ホスト出版物のサブタイトルMerging Optical and IP Technologies, Proceedings
出版社IEEE Computer Society
ページ88-92
ページ数5
ISBN(印刷版)488552184X, 9784885521843
DOI
出版ステータスPublished - 2002 1 1
外部発表はい
イベント2002 Workshop on High Performance Switching and Routing: Merging Optical and IP Technologies, HPSR 2002 - Kobe, Japan
継続期間: 2002 5 262002 5 29

出版物シリーズ

名前IEEE International Conference on High Performance Switching and Routing, HPSR
ISSN(印刷版)2325-5595
ISSN(電子版)2325-5609

Other

Other2002 Workshop on High Performance Switching and Routing: Merging Optical and IP Technologies, HPSR 2002
国/地域Japan
CityKobe
Period02/5/2602/5/29

ASJC Scopus subject areas

  • ハードウェアとアーキテクチャ
  • 電子工学および電気工学

フィンガープリント

「A disjoint path selection scheme with SRLG in GMPLS networks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル