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
Cet article propose un modèle de placement de fonction de réseau virtuel (VNF) prenant en compte à la fois la disponibilité et la protection probabiliste du délai de service afin de minimiser le coût de déploiement du service. La disponibilité et le délai de service sont des exigences clés des services ; un fournisseur de services gère le problème de placement VNF dans le but de minimiser le coût de déploiement du service tout en répondant à ces exigences et à d'autres. Les travaux précédents ne prennent pas en compte le retard de chaque itinéraire que le service peut emprunter en considérant à la fois la disponibilité et le retard dans le problème de placement des VNF ; seul le délai maximum a été pris en compte. Nous introduisons une protection probabiliste pour le retard de service afin de minimiser le coût de déploiement du service avec disponibilité. Le modèle proposé considère que la probabilité que le délai de service, qui consiste en un délai de mise en réseau entre les hôtes et un délai de traitement dans chaque VNF, dépasse son seuil est limitée à une valeur donnée ; il considère également que la disponibilité est limitée à une valeur donnée. Nous développons un algorithme heuristique en deux étapes pour résoudre le problème de placement VNF ; il décide du placement du VNF principal en résolvant la programmation de cônes de second ordre à nombres entiers mixtes dans la première étape et le placement du VNF de secours dans la deuxième étape. Nous observons que le modèle proposé réduit le coût de déploiement du service par rapport à une base de référence prenant en compte le délai maximum jusqu'à 12 %, et qu'il obtient une solution réalisable alors que la base de référence ne le fait pas dans certaines situations examinées.
Shinya HORIMOTO
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.
Copier
Shinya HORIMOTO, Eiji OKI, "Virtual Network Function Placement Model Considering Both Availability and Probabilistic Protection for Service Delay" in IEICE TRANSACTIONS on Communications,
vol. E106-B, no. 10, pp. 891-902, October 2023, doi: 10.1587/transcom.2022EBP3186.
Abstract: This paper proposes a virtual network function (VNF) placement model considering both availability and probabilistic protection for the service delay to minimize the service deployment cost. Both availability and service delay are key requirements of services; a service provider handles the VNF placement problem with the goal of minimizing the service deployment cost while meeting these and other requirements. The previous works do not consider the delay of each route which the service can take when considering both availability and delay in the VNF placement problem; only the maximum delay was considered. We introduce probabilistic protection for service delay to minimize the service deployment cost with availability. 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; it also considers that the availability is constrained within a given value. We develop a two-stage heuristic algorithm to solve the VNF placement problem; it decides primary VNF placement by solving mixed-integer second-order cone programming in the first stage and backup VNF placement in the second stage. We observe that the proposed model reduces the service deployment cost compared to a baseline that considers the maximum delay by up to 12%, and that it obtains a feasible solution while the baseline does not in some examined situations.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2022EBP3186/_p
Copier
@ARTICLE{e106-b_10_891,
author={Shinya HORIMOTO, Eiji OKI, },
journal={IEICE TRANSACTIONS on Communications},
title={Virtual Network Function Placement Model Considering Both Availability and Probabilistic Protection for Service Delay},
year={2023},
volume={E106-B},
number={10},
pages={891-902},
abstract={This paper proposes a virtual network function (VNF) placement model considering both availability and probabilistic protection for the service delay to minimize the service deployment cost. Both availability and service delay are key requirements of services; a service provider handles the VNF placement problem with the goal of minimizing the service deployment cost while meeting these and other requirements. The previous works do not consider the delay of each route which the service can take when considering both availability and delay in the VNF placement problem; only the maximum delay was considered. We introduce probabilistic protection for service delay to minimize the service deployment cost with availability. 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; it also considers that the availability is constrained within a given value. We develop a two-stage heuristic algorithm to solve the VNF placement problem; it decides primary VNF placement by solving mixed-integer second-order cone programming in the first stage and backup VNF placement in the second stage. We observe that the proposed model reduces the service deployment cost compared to a baseline that considers the maximum delay by up to 12%, and that it obtains a feasible solution while the baseline does not in some examined situations.},
keywords={},
doi={10.1587/transcom.2022EBP3186},
ISSN={1745-1345},
month={October},}
Copier
TY - JOUR
TI - Virtual Network Function Placement Model Considering Both Availability and Probabilistic Protection for Service Delay
T2 - IEICE TRANSACTIONS on Communications
SP - 891
EP - 902
AU - Shinya HORIMOTO
AU - Eiji OKI
PY - 2023
DO - 10.1587/transcom.2022EBP3186
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E106-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2023
AB - This paper proposes a virtual network function (VNF) placement model considering both availability and probabilistic protection for the service delay to minimize the service deployment cost. Both availability and service delay are key requirements of services; a service provider handles the VNF placement problem with the goal of minimizing the service deployment cost while meeting these and other requirements. The previous works do not consider the delay of each route which the service can take when considering both availability and delay in the VNF placement problem; only the maximum delay was considered. We introduce probabilistic protection for service delay to minimize the service deployment cost with availability. 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; it also considers that the availability is constrained within a given value. We develop a two-stage heuristic algorithm to solve the VNF placement problem; it decides primary VNF placement by solving mixed-integer second-order cone programming in the first stage and backup VNF placement in the second stage. We observe that the proposed model reduces the service deployment cost compared to a baseline that considers the maximum delay by up to 12%, and that it obtains a feasible solution while the baseline does not in some examined situations.
ER -