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
N1 - Funding Information:
ACKNOWLEDGMENT This work is partly supported by the R&D of innovative optical network technologies for supporting new social infrastructure project funded by the Ministry of Internal Affairs and Communications Japan.
Publisher Copyright:
© 2019 IEEE.
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.
T2 - 2019 International Conference on Computing, Networking and Communications, ICNC 2019
Y2 - 18 February 2019 through 21 February 2019
ER -