Expected capacity guaranteed routing method based on failure probability of links

Shu Sekigawa, Eiji Oki, Takehiro Sato, Satoru Okamoto, Naoaki Yamanaka

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

In a high-speed backbone network, the failure of a network link may cause large data losses, so it is necessary to reserve spare network resources for faster recovery. The conventional protection methods to reserve backup routes do not consider the failure probability of each network link, so the same amount of network resources for the backup route are needed regardless of the failure probability of network links. This leads a decrease in the number of connections that can be accepted into the network. This paper proposes a routing and capacity allocation method that guarantees the expected value of allocated capacity. We formulate a mixed integer liner programming model for the proposed method. We conduct simulations to study the advantage of the expected capacity guaranteed routing over the conventional routing method in terms of bandwidth blocking probability. The results show that the proposed method reduces the bandwidth blocking probability to about 1/3 as compared to that of the conventional path protection method.

本文言語English
ホスト出版物のタイトルLANMAN 2017 - 23rd IEEE International Symposium on Local and Metropolitan Area Networks
出版社IEEE Computer Society
2017-June
ISBN(電子版)9781538607282
DOI
出版ステータスPublished - 2017 7月 7
イベント23rd IEEE International Symposium on Local and Metropolitan Area Networks, LANMAN 2017 - Osaka, Japan
継続期間: 2017 6月 122017 6月 14

Other

Other23rd IEEE International Symposium on Local and Metropolitan Area Networks, LANMAN 2017
国/地域Japan
CityOsaka
Period17/6/1217/6/14

ASJC Scopus subject areas

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

フィンガープリント

「Expected capacity guaranteed routing method based on failure probability of links」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル