Virtual network functions (VNFs) have been widely deployed in mobile edge computing (MEC) to flexibly and efficiently serve end users running resource-intensive applications, which can be further serialized to form service function chains (SFCs), providing customized networking services. To ensure the availability of SFCs, it turns out to be effective to place redundant SFC backups at the edge for quickly recovering from any failures. The existing research largely overlooks the influences of SFC popularity, backup completeness and failure rate on the optimal deployment of SFC backups on edge servers. In this paper, we comprehensively consider from the perspectives of both the end users and edge system to backup SFCs for providing popular services with the lowest latency. To overcome the challenges resulted from unknown SFC popularity and failure rate, as well as the known system parameter constraints, we take advantage of the online bandit learning technique to cope with the uncertainty issue. Combining the Prim-inspired method with the greedy strategy, we propose a Real-Time Selection and Deployment(RTSD) algorithm. Extensive simulation experiments are conducted to demonstrate the superiority of our proposed algorithms.
翻译:虚拟网络功能(VNFs)被广泛用于移动边缘计算(MEC),以灵活和高效地为运行资源密集型应用程序的终端用户服务,这些应用程序可以进一步序列化,形成服务功能链(SFCs),提供定制的网络服务。为了确保SFCs的可用性,事实证明,将多余的SFC备份置于边缘边缘,以便迅速从任何故障中恢复。现有研究在很大程度上忽略了SFC广受欢迎、备份完整和故障率对在边缘服务器上最佳部署SFC备份的影响。在本文中,我们从终端用户和边缘系统的角度全面考虑支持SFCs,以最低的延缓度提供大众服务。为了克服由未知SFC的受欢迎率和故障率以及已知的系统参数限制带来的挑战,我们利用在线带宽学习技术应对不确定性问题,我们利用了网上带宽度学习技术应对不确定性问题。我们提议将普里姆激励的方法与贪婪战略相结合,我们建议采用实时选择和部署(RTSD)算法。我们进行了广泛的模拟实验,以展示我们提议的算法的优越性。