Expected capacity guaranteed routing method based on failure probability of links

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationLANMAN 2017 - 23rd IEEE International Symposium on Local and Metropolitan Area Networks
PublisherIEEE Computer Society
Volume2017-June
ISBN (Electronic)9781538607282
DOIs
Publication statusPublished - 2017 Jul 7
Event23rd IEEE International Symposium on Local and Metropolitan Area Networks, LANMAN 2017 - Osaka, Japan
Duration: 2017 Jun 122017 Jun 14

Other

Other23rd IEEE International Symposium on Local and Metropolitan Area Networks, LANMAN 2017
CountryJapan
CityOsaka
Period17/6/1217/6/14

Fingerprint

Blocking probability
Bandwidth
HIgh speed networks
Integer programming
Recovery
resources
guarantee
programming
simulation
cause

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software
  • Electrical and Electronic Engineering
  • Communication

Cite this

Sekigawa, S., Oki, E., Sato, T., Okamoto, S., & Yamanaka, N. (2017). Expected capacity guaranteed routing method based on failure probability of links. In LANMAN 2017 - 23rd IEEE International Symposium on Local and Metropolitan Area Networks (Vol. 2017-June). [7972156] IEEE Computer Society. https://doi.org/10.1109/LANMAN.2017.7972156

Expected capacity guaranteed routing method based on failure probability of links. / Sekigawa, Shu; Oki, Eiji; Sato, Takehiro; Okamoto, Satoru; Yamanaka, Naoaki.

LANMAN 2017 - 23rd IEEE International Symposium on Local and Metropolitan Area Networks. Vol. 2017-June IEEE Computer Society, 2017. 7972156.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sekigawa, S, Oki, E, Sato, T, Okamoto, S & Yamanaka, N 2017, Expected capacity guaranteed routing method based on failure probability of links. in LANMAN 2017 - 23rd IEEE International Symposium on Local and Metropolitan Area Networks. vol. 2017-June, 7972156, IEEE Computer Society, 23rd IEEE International Symposium on Local and Metropolitan Area Networks, LANMAN 2017, Osaka, Japan, 17/6/12. https://doi.org/10.1109/LANMAN.2017.7972156
Sekigawa S, Oki E, Sato T, Okamoto S, Yamanaka N. Expected capacity guaranteed routing method based on failure probability of links. In LANMAN 2017 - 23rd IEEE International Symposium on Local and Metropolitan Area Networks. Vol. 2017-June. IEEE Computer Society. 2017. 7972156 https://doi.org/10.1109/LANMAN.2017.7972156
Sekigawa, Shu ; Oki, Eiji ; Sato, Takehiro ; Okamoto, Satoru ; Yamanaka, Naoaki. / Expected capacity guaranteed routing method based on failure probability of links. LANMAN 2017 - 23rd IEEE International Symposium on Local and Metropolitan Area Networks. Vol. 2017-June IEEE Computer Society, 2017.
@inproceedings{a4731482aa6f4b568c9a1de66d8a8cce,
title = "Expected capacity guaranteed routing method based on failure probability of links",
abstract = "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.",
author = "Shu Sekigawa and Eiji Oki and Takehiro Sato and Satoru Okamoto and Naoaki Yamanaka",
year = "2017",
month = "7",
day = "7",
doi = "10.1109/LANMAN.2017.7972156",
language = "English",
volume = "2017-June",
booktitle = "LANMAN 2017 - 23rd IEEE International Symposium on Local and Metropolitan Area Networks",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Expected capacity guaranteed routing method based on failure probability of links

AU - Sekigawa, Shu

AU - Oki, Eiji

AU - Sato, Takehiro

AU - Okamoto, Satoru

AU - Yamanaka, Naoaki

PY - 2017/7/7

Y1 - 2017/7/7

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85027278578&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85027278578&partnerID=8YFLogxK

U2 - 10.1109/LANMAN.2017.7972156

DO - 10.1109/LANMAN.2017.7972156

M3 - Conference contribution

VL - 2017-June

BT - LANMAN 2017 - 23rd IEEE International Symposium on Local and Metropolitan Area Networks

PB - IEEE Computer Society

ER -