Expected Capacity Guaranteed Routing based on Dynamic Link Failure Prediction

Shu Sekigawa, Satoru Okamoto, Naoaki Yamanaka, Eiji Oki

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

Abstract

In a high-speed backbone network, the failure of network links may cause large data losses, so it is necessary to reserve spare network resources for faster recovery. The conventional protection methods that reserve backup paths do not consider the failure probability of each network link and allocate same amount of network resources for the backup paths regardless of the failure rate of network links. This leads to the excessive or insufficient capacity allocation. This paper proposes the routing method that guarantees the expected value of the allocated capacity based on dynamically changed link failure rate. We formulate a Mixed Integer Liner Programming (MILP) model for the proposed method. We conduct simulations to investigate the effect of the expected capacity guaranteed routing over the conventional routing method in terms of bandwidth blocking probability, transmitted capacity achieved ratio, and the ratio of total transmitted capacity to total requested capacity. The results show that our proposed method marks higher transmitted capacity achieved ratio compared to conventional routing methods. We also find the transmitted capacity achieved ratio of the proposed method maintains 90% under high failure rate.

Original languageEnglish
Title of host publication2019 International Conference on Computing, Networking and Communications, ICNC 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages170-174
Number of pages5
ISBN (Electronic)9781538692233
DOIs
Publication statusPublished - 2019 Apr 8
Event2019 International Conference on Computing, Networking and Communications, ICNC 2019 - Honolulu, United States
Duration: 2019 Feb 182019 Feb 21

Publication series

Name2019 International Conference on Computing, Networking and Communications, ICNC 2019

Conference

Conference2019 International Conference on Computing, Networking and Communications, ICNC 2019
CountryUnited States
CityHonolulu
Period19/2/1819/2/21

Fingerprint

HIgh speed networks
Blocking probability
Integer programming
Bandwidth
Recovery

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software
  • Hardware and Architecture

Cite this

Sekigawa, S., Okamoto, S., Yamanaka, N., & Oki, E. (2019). Expected Capacity Guaranteed Routing based on Dynamic Link Failure Prediction. In 2019 International Conference on Computing, Networking and Communications, ICNC 2019 (pp. 170-174). [8685646] (2019 International Conference on Computing, Networking and Communications, ICNC 2019). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICCNC.2019.8685646

Expected Capacity Guaranteed Routing based on Dynamic Link Failure Prediction. / Sekigawa, Shu; Okamoto, Satoru; Yamanaka, Naoaki; Oki, Eiji.

2019 International Conference on Computing, Networking and Communications, ICNC 2019. Institute of Electrical and Electronics Engineers Inc., 2019. p. 170-174 8685646 (2019 International Conference on Computing, Networking and Communications, ICNC 2019).

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

Sekigawa, S, Okamoto, S, Yamanaka, N & Oki, E 2019, Expected Capacity Guaranteed Routing based on Dynamic Link Failure Prediction. in 2019 International Conference on Computing, Networking and Communications, ICNC 2019., 8685646, 2019 International Conference on Computing, Networking and Communications, ICNC 2019, Institute of Electrical and Electronics Engineers Inc., pp. 170-174, 2019 International Conference on Computing, Networking and Communications, ICNC 2019, Honolulu, United States, 19/2/18. https://doi.org/10.1109/ICCNC.2019.8685646
Sekigawa S, Okamoto S, Yamanaka N, Oki E. Expected Capacity Guaranteed Routing based on Dynamic Link Failure Prediction. In 2019 International Conference on Computing, Networking and Communications, ICNC 2019. Institute of Electrical and Electronics Engineers Inc. 2019. p. 170-174. 8685646. (2019 International Conference on Computing, Networking and Communications, ICNC 2019). https://doi.org/10.1109/ICCNC.2019.8685646
Sekigawa, Shu ; Okamoto, Satoru ; Yamanaka, Naoaki ; Oki, Eiji. / Expected Capacity Guaranteed Routing based on Dynamic Link Failure Prediction. 2019 International Conference on Computing, Networking and Communications, ICNC 2019. Institute of Electrical and Electronics Engineers Inc., 2019. pp. 170-174 (2019 International Conference on Computing, Networking and Communications, ICNC 2019).
@inproceedings{7294c5a152744626ac74a1cd1afb4689,
title = "Expected Capacity Guaranteed Routing based on Dynamic Link Failure Prediction",
abstract = "In a high-speed backbone network, the failure of network links may cause large data losses, so it is necessary to reserve spare network resources for faster recovery. The conventional protection methods that reserve backup paths do not consider the failure probability of each network link and allocate same amount of network resources for the backup paths regardless of the failure rate of network links. This leads to the excessive or insufficient capacity allocation. This paper proposes the routing method that guarantees the expected value of the allocated capacity based on dynamically changed link failure rate. We formulate a Mixed Integer Liner Programming (MILP) model for the proposed method. We conduct simulations to investigate the effect of the expected capacity guaranteed routing over the conventional routing method in terms of bandwidth blocking probability, transmitted capacity achieved ratio, and the ratio of total transmitted capacity to total requested capacity. The results show that our proposed method marks higher transmitted capacity achieved ratio compared to conventional routing methods. We also find the transmitted capacity achieved ratio of the proposed method maintains 90{\%} under high failure rate.",
author = "Shu Sekigawa and Satoru Okamoto and Naoaki Yamanaka and Eiji Oki",
year = "2019",
month = "4",
day = "8",
doi = "10.1109/ICCNC.2019.8685646",
language = "English",
series = "2019 International Conference on Computing, Networking and Communications, ICNC 2019",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "170--174",
booktitle = "2019 International Conference on Computing, Networking and Communications, ICNC 2019",

}

TY - GEN

T1 - Expected Capacity Guaranteed Routing based on Dynamic Link Failure Prediction

AU - Sekigawa, Shu

AU - Okamoto, Satoru

AU - Yamanaka, Naoaki

AU - Oki, Eiji

PY - 2019/4/8

Y1 - 2019/4/8

N2 - In a high-speed backbone network, the failure of network links may cause large data losses, so it is necessary to reserve spare network resources for faster recovery. The conventional protection methods that reserve backup paths do not consider the failure probability of each network link and allocate same amount of network resources for the backup paths regardless of the failure rate of network links. This leads to the excessive or insufficient capacity allocation. This paper proposes the routing method that guarantees the expected value of the allocated capacity based on dynamically changed link failure rate. We formulate a Mixed Integer Liner Programming (MILP) model for the proposed method. We conduct simulations to investigate the effect of the expected capacity guaranteed routing over the conventional routing method in terms of bandwidth blocking probability, transmitted capacity achieved ratio, and the ratio of total transmitted capacity to total requested capacity. The results show that our proposed method marks higher transmitted capacity achieved ratio compared to conventional routing methods. We also find the transmitted capacity achieved ratio of the proposed method maintains 90% under high failure rate.

AB - In a high-speed backbone network, the failure of network links may cause large data losses, so it is necessary to reserve spare network resources for faster recovery. The conventional protection methods that reserve backup paths do not consider the failure probability of each network link and allocate same amount of network resources for the backup paths regardless of the failure rate of network links. This leads to the excessive or insufficient capacity allocation. This paper proposes the routing method that guarantees the expected value of the allocated capacity based on dynamically changed link failure rate. We formulate a Mixed Integer Liner Programming (MILP) model for the proposed method. We conduct simulations to investigate the effect of the expected capacity guaranteed routing over the conventional routing method in terms of bandwidth blocking probability, transmitted capacity achieved ratio, and the ratio of total transmitted capacity to total requested capacity. The results show that our proposed method marks higher transmitted capacity achieved ratio compared to conventional routing methods. We also find the transmitted capacity achieved ratio of the proposed method maintains 90% under high failure rate.

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

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

U2 - 10.1109/ICCNC.2019.8685646

DO - 10.1109/ICCNC.2019.8685646

M3 - Conference contribution

AN - SCOPUS:85064970837

T3 - 2019 International Conference on Computing, Networking and Communications, ICNC 2019

SP - 170

EP - 174

BT - 2019 International Conference on Computing, Networking and Communications, ICNC 2019

PB - Institute of Electrical and Electronics Engineers Inc.

ER -