IEICE TRANSACTIONS on Communications
Virtual Network Function Placement Model Considering Both Availability and Probabilistic Protection for Service Delay
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E106-B No.10 pp.891-902
- Publication Date
- 2023/10/01
- Publicized
- 2023/04/13
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.2022EBP3186
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Shinya HORIMOTO
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, 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
Copy
@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},}
Copy
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 -
English
