IEICE TRANSACTIONS on Communications
Optimization Approach to Minimize Backup Capacity Considering Routing in Primary and Backup Networks for Random Multiple Link Failures
Summary :
This paper proposes an optimization approach that designs the backup network with the minimum total capacity to protect the primary network from random multiple link failures with link failure probability. In the conventional approach, the routing in the primary network is not considered as a factor in minimizing the total capacity of the backup network. Considering primary routing as a variable when deciding the backup network can reduce the total capacity in the backup network compared to the conventional approach. The optimization problem examined here employs robust optimization to provide probabilistic survivability guarantees for different link capacities in the primary network. The proposed approach formulates the optimization problem as a mixed integer linear programming (MILP) problem with robust optimization. A heuristic implementation is introduced for the proposed approach as the MILP problem cannot be solved in practical time when the network size increases. Numerical results show that the proposed approach can achieve lower total capacity in the backup network than the conventional approach.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E103-B No.7 pp.726-735
- Publication Date
- 2020/07/01
- Publicized
- 2020/01/17
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.2019EBP3173
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Soudalin KHOUANGVICHIT
The University of Electro-Communications
Nattapong KITSUWAN
The University of Electro-Communications
Eiji OKI
Kyoto University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Soudalin KHOUANGVICHIT, Nattapong KITSUWAN, Eiji OKI, "Optimization Approach to Minimize Backup Capacity Considering Routing in Primary and Backup Networks for Random Multiple Link Failures" in IEICE TRANSACTIONS on Communications,
vol. E103-B, no. 7, pp. 726-735, July 2020, doi: 10.1587/transcom.2019EBP3173.
Abstract: This paper proposes an optimization approach that designs the backup network with the minimum total capacity to protect the primary network from random multiple link failures with link failure probability. In the conventional approach, the routing in the primary network is not considered as a factor in minimizing the total capacity of the backup network. Considering primary routing as a variable when deciding the backup network can reduce the total capacity in the backup network compared to the conventional approach. The optimization problem examined here employs robust optimization to provide probabilistic survivability guarantees for different link capacities in the primary network. The proposed approach formulates the optimization problem as a mixed integer linear programming (MILP) problem with robust optimization. A heuristic implementation is introduced for the proposed approach as the MILP problem cannot be solved in practical time when the network size increases. Numerical results show that the proposed approach can achieve lower total capacity in the backup network than the conventional approach.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2019EBP3173/_p
Copy
@ARTICLE{e103-b_7_726,
author={Soudalin KHOUANGVICHIT, Nattapong KITSUWAN, Eiji OKI, },
journal={IEICE TRANSACTIONS on Communications},
title={Optimization Approach to Minimize Backup Capacity Considering Routing in Primary and Backup Networks for Random Multiple Link Failures},
year={2020},
volume={E103-B},
number={7},
pages={726-735},
abstract={This paper proposes an optimization approach that designs the backup network with the minimum total capacity to protect the primary network from random multiple link failures with link failure probability. In the conventional approach, the routing in the primary network is not considered as a factor in minimizing the total capacity of the backup network. Considering primary routing as a variable when deciding the backup network can reduce the total capacity in the backup network compared to the conventional approach. The optimization problem examined here employs robust optimization to provide probabilistic survivability guarantees for different link capacities in the primary network. The proposed approach formulates the optimization problem as a mixed integer linear programming (MILP) problem with robust optimization. A heuristic implementation is introduced for the proposed approach as the MILP problem cannot be solved in practical time when the network size increases. Numerical results show that the proposed approach can achieve lower total capacity in the backup network than the conventional approach.},
keywords={},
doi={10.1587/transcom.2019EBP3173},
ISSN={1745-1345},
month={July},}
Copy
TY - JOUR
TI - Optimization Approach to Minimize Backup Capacity Considering Routing in Primary and Backup Networks for Random Multiple Link Failures
T2 - IEICE TRANSACTIONS on Communications
SP - 726
EP - 735
AU - Soudalin KHOUANGVICHIT
AU - Nattapong KITSUWAN
AU - Eiji OKI
PY - 2020
DO - 10.1587/transcom.2019EBP3173
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E103-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2020
AB - This paper proposes an optimization approach that designs the backup network with the minimum total capacity to protect the primary network from random multiple link failures with link failure probability. In the conventional approach, the routing in the primary network is not considered as a factor in minimizing the total capacity of the backup network. Considering primary routing as a variable when deciding the backup network can reduce the total capacity in the backup network compared to the conventional approach. The optimization problem examined here employs robust optimization to provide probabilistic survivability guarantees for different link capacities in the primary network. The proposed approach formulates the optimization problem as a mixed integer linear programming (MILP) problem with robust optimization. A heuristic implementation is introduced for the proposed approach as the MILP problem cannot be solved in practical time when the network size increases. Numerical results show that the proposed approach can achieve lower total capacity in the backup network than the conventional approach.
ER -
English
