Availability Aware Online Virtual Network Function Backup in Edge Environments
Availability Aware Online Virtual Network Function Backup in Edge Environments
复制标题
DOI：
10.1109/tmc.2023.3282156
复制
发表时间：
2024-05
影响因子：
7.9
通讯作者：
Yu Liu;Xiaojun Shang;Yingling Mao;Z. Liu;Yuanyuan Yang
中科院分区：
文献类型：
--
作者：
Yu Liu;Xiaojun Shang;Yingling Mao;Z. Liu;Yuanyuan Yang
随着边缘计算和网络功能虚拟化的快速发展，在边缘提供灵活、低延迟的网络服务是很有希望的。然而，由于边缘服务的脆弱性和边缘计算系统状态的易变性，即，服务请求率、故障率和资源价格，在提供可用性保证的同时最小化在线服务成本是具有挑战性的。本文研究了边缘环境下基于可用性约束的在线虚拟网络功能备份问题。我们制定的问题的基础上的波动性系统的状态来自现实世界的数据的特点，并显示制定的问题的硬度。我们使用一个在线备份部署方案名为漂移加惩罚（DPP）与可证明的OVBAC问题的性能接近最优。特别地，DPP需要在每个时隙开始时解决整数规划问题。我们提出了一个基于动态规划的算法，可以最优地解决问题的伪多项式时间。广泛的真实世界数据驱动的模拟表明，DPP显着优于在实践中使用的流行基线。
With the rapid advancement of edge computing and network function virtualization, it is promising to provide flexible and low-latency network services at the edge. However, due to the vulnerability of edge services and the volatility of edge computing system states, i.e., service request rates, failure rates, and resource prices, it is challenging to minimize the online service cost while providing the availability guarantee. This article considers the problem of online virtual network function backup under availability constraints (OVBAC) for cost minimization in edge environments. We formulate the problem based on the characteristics of the volatility system states derived from real-world data and show the hardness of the formulated problem. We use an online backup deployment scheme named Drift-Plus-Penalty (DPP) with provable near-optimal performance for the OVBAC problem. In particular, DPP needs to solve an integer programming problem at the beginning of each time slot. We propose a dynamic programming-based algorithm that can optimally solve the problem in pseudo-polynomial time. Extensive real-world data-driven simulations demonstrate that DPP significantly outperforms popular baselines used in practice.