IEICE TRANSACTIONS on Communications
Backup Resource Allocation Model with Probabilistic Protection Considering Service Delay
Summary :
This paper proposes a backup resource allocation model for virtual network functions (VNFs) to minimize the total allocated computing capacity for backup with considering the service delay. If failures occur to primary hosts, the VNFs in failed hosts are recovered by backup hosts whose allocation is pre-determined. We introduce probabilistic protection, where the probability that the protection by a backup host fails is limited within a given value; it allows backup resource sharing to reduce the total allocated computing capacity. The previous work does not consider the service delay constraint in the backup resource allocation problem. The proposed model considers that the probability that the service delay, which consists of networking delay between hosts and processing delay in each VNF, exceeds its threshold is constrained within a given value. We introduce a basic algorithm to solve our formulated delay-constraint optimization problem. In a problem with the size that cannot be solved within an acceptable computation time limit by the basic algorithm, we develop a simulated annealing algorithm incorporating Yen's algorithm to handle the delay constraint heuristically. We observe that both algorithms in the proposed model reduce the total allocated computing capacity by up to 56.3% compared to a baseline; the simulated annealing algorithm can get feasible solutions in problems where the basic algorithm cannot.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E106-B No.9 pp.798-816
- Publication Date
- 2023/09/01
- Publicized
- 2023/03/24
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.2022EBP3182
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Shinya HORIMOTO
Kyoto University
Fujun HE
Kyoto University
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
Shinya HORIMOTO, Fujun HE, Eiji OKI, "Backup Resource Allocation Model with Probabilistic Protection Considering Service Delay" in IEICE TRANSACTIONS on Communications,
vol. E106-B, no. 9, pp. 798-816, September 2023, doi: 10.1587/transcom.2022EBP3182.
Abstract: This paper proposes a backup resource allocation model for virtual network functions (VNFs) to minimize the total allocated computing capacity for backup with considering the service delay. If failures occur to primary hosts, the VNFs in failed hosts are recovered by backup hosts whose allocation is pre-determined. We introduce probabilistic protection, where the probability that the protection by a backup host fails is limited within a given value; it allows backup resource sharing to reduce the total allocated computing capacity. The previous work does not consider the service delay constraint in the backup resource allocation problem. The proposed model considers that the probability that the service delay, which consists of networking delay between hosts and processing delay in each VNF, exceeds its threshold is constrained within a given value. We introduce a basic algorithm to solve our formulated delay-constraint optimization problem. In a problem with the size that cannot be solved within an acceptable computation time limit by the basic algorithm, we develop a simulated annealing algorithm incorporating Yen's algorithm to handle the delay constraint heuristically. We observe that both algorithms in the proposed model reduce the total allocated computing capacity by up to 56.3% compared to a baseline; the simulated annealing algorithm can get feasible solutions in problems where the basic algorithm cannot.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2022EBP3182/_p
Copy
@ARTICLE{e106-b_9_798,
author={Shinya HORIMOTO, Fujun HE, Eiji OKI, },
journal={IEICE TRANSACTIONS on Communications},
title={Backup Resource Allocation Model with Probabilistic Protection Considering Service Delay},
year={2023},
volume={E106-B},
number={9},
pages={798-816},
abstract={This paper proposes a backup resource allocation model for virtual network functions (VNFs) to minimize the total allocated computing capacity for backup with considering the service delay. If failures occur to primary hosts, the VNFs in failed hosts are recovered by backup hosts whose allocation is pre-determined. We introduce probabilistic protection, where the probability that the protection by a backup host fails is limited within a given value; it allows backup resource sharing to reduce the total allocated computing capacity. The previous work does not consider the service delay constraint in the backup resource allocation problem. The proposed model considers that the probability that the service delay, which consists of networking delay between hosts and processing delay in each VNF, exceeds its threshold is constrained within a given value. We introduce a basic algorithm to solve our formulated delay-constraint optimization problem. In a problem with the size that cannot be solved within an acceptable computation time limit by the basic algorithm, we develop a simulated annealing algorithm incorporating Yen's algorithm to handle the delay constraint heuristically. We observe that both algorithms in the proposed model reduce the total allocated computing capacity by up to 56.3% compared to a baseline; the simulated annealing algorithm can get feasible solutions in problems where the basic algorithm cannot.},
keywords={},
doi={10.1587/transcom.2022EBP3182},
ISSN={1745-1345},
month={September},}
Copy
TY - JOUR
TI - Backup Resource Allocation Model with Probabilistic Protection Considering Service Delay
T2 - IEICE TRANSACTIONS on Communications
SP - 798
EP - 816
AU - Shinya HORIMOTO
AU - Fujun HE
AU - Eiji OKI
PY - 2023
DO - 10.1587/transcom.2022EBP3182
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E106-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2023
AB - This paper proposes a backup resource allocation model for virtual network functions (VNFs) to minimize the total allocated computing capacity for backup with considering the service delay. If failures occur to primary hosts, the VNFs in failed hosts are recovered by backup hosts whose allocation is pre-determined. We introduce probabilistic protection, where the probability that the protection by a backup host fails is limited within a given value; it allows backup resource sharing to reduce the total allocated computing capacity. The previous work does not consider the service delay constraint in the backup resource allocation problem. The proposed model considers that the probability that the service delay, which consists of networking delay between hosts and processing delay in each VNF, exceeds its threshold is constrained within a given value. We introduce a basic algorithm to solve our formulated delay-constraint optimization problem. In a problem with the size that cannot be solved within an acceptable computation time limit by the basic algorithm, we develop a simulated annealing algorithm incorporating Yen's algorithm to handle the delay constraint heuristically. We observe that both algorithms in the proposed model reduce the total allocated computing capacity by up to 56.3% compared to a baseline; the simulated annealing algorithm can get feasible solutions in problems where the basic algorithm cannot.
ER -
English
