The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Kertas kerja ini mencadangkan model peruntukan sumber sandaran untuk fungsi rangkaian maya (VNF) untuk meminimumkan jumlah kapasiti pengkomputeran yang diperuntukkan untuk sandaran dengan mengambil kira kelewatan perkhidmatan. Jika kegagalan berlaku pada hos utama, VNF dalam hos yang gagal dipulihkan oleh hos sandaran yang peruntukannya telah ditentukan terlebih dahulu. Kami memperkenalkan perlindungan kebarangkalian, di mana kebarangkalian perlindungan oleh hos sandaran gagal adalah terhad dalam nilai tertentu; ia membenarkan perkongsian sumber sandaran untuk mengurangkan jumlah kapasiti pengkomputeran yang diperuntukkan. Kerja sebelumnya tidak mengambil kira kekangan kelewatan perkhidmatan dalam masalah peruntukan sumber sandaran. Model yang dicadangkan menganggap bahawa kebarangkalian bahawa kelewatan perkhidmatan, yang terdiri daripada kelewatan rangkaian antara hos dan kelewatan pemprosesan dalam setiap VNF, melebihi ambangnya dikekang dalam nilai tertentu. Kami memperkenalkan algoritma asas untuk menyelesaikan masalah pengoptimuman kekangan kelewatan kami yang dirumuskan. Dalam masalah dengan saiz yang tidak dapat diselesaikan dalam had masa pengiraan yang boleh diterima oleh algoritma asas, kami membangunkan algoritma penyepuhlindapan simulasi yang menggabungkan algoritma Yen untuk mengendalikan kekangan kelewatan secara heuristik. Kami mendapati bahawa kedua-dua algoritma dalam model yang dicadangkan mengurangkan jumlah kapasiti pengkomputeran yang diperuntukkan sehingga 56.3% berbanding garis dasar; algoritma penyepuhlindapan simulasi boleh mendapatkan penyelesaian yang boleh dilaksanakan dalam masalah di mana algoritma asas tidak boleh.
Shinya HORIMOTO
Kyoto University
Fujun HE
Kyoto University
Eiji OKI
Kyoto University
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.
Salinan
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
Salinan
@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},}
Salinan
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 -