We consider the problem of service hosting where an application provider can dynamically rent edge computing resources and serve user requests from the edge to deliver a better quality of service. A key novelty of this work is that we allow the service to be hosted partially at the edge which enables a fraction of the user query to be served by the edge. We model the total cost for (partially) hosting a service at the edge as a combination of the latency in serving requests, the bandwidth consumption, and the time-varying cost for renting edge resources. We propose an online policy called $α$-RetroRenting ($α$-RR) which dynamically determines the fraction of the service to be hosted at the edge in any time-slot, based on the history of the request arrivals and the rent cost sequence. As our main result, we derive an upper bound on $α$-RR's competitive ratio with respect to the offline optimal policy that knows the entire request arrival and rent cost sequence in advance. We conduct extensive numerical evaluations to compare the performance of $α$-RR with various benchmarks for synthetic and trace-based request arrival and rent cost processes, and find several parameter regimes where $α$-RR's ability to store the service partially greatly improves cost-efficiency.
Online VNF Placement and Chaining for Value-added Services in Content Delivery Networks
增值服务(VAS)(例如,动态站点加速、媒体管理)在内容分发网络(CDN)中起着关键作用。网络功能虚拟化(NFV)实现了VAS的敏捷配置。在NFV设置中,VAS被提供为虚拟网络功能(VNF)的有序集合,形成部署在CDN基础设施中的VNF转发图(VNF-FG)。CDN VAS VNF-FG具有特定的特性:它们具有一个端点(对应于内容服务器),该端点在它们的放置之前是未知的。到目前为止,CDN VAS VNF-FG放置的提案仅考虑了离线放置,其中VNF-FG在最终用户流量转向网络之前放置。然而,在具体情况下,可能发生服务使用模式的变化,这种情况可能需要以在线方式放置VNF-FG。本文解决了CDN中VAS的在线VNF-FG放置问题,考虑到已部署VNF的最终重用和迁移。考虑成本模型,包括多个成本;即,新的VNF实例化、迁移、托管和路由成本。目标是最佳地放置VNF-FG,使得在满足QoS的同时最小化总重新配置成本。一个非线性规划(ILP)制定和评估在一个小规模的情况下。
Slicing for AI: An Online Learning Framework for Network Slicing Supporting AI Services
College of Engineering, Qatar University(卡塔尔大学工程学院);College of Electrical Engineering, Mathematics, and Computer Science, TU Delft(代尔夫特理工大学电气工程、数学与计算机科学学院)
RetroRenting: An Online Policy for Service Caching at the Edge
共享边缘计算平台的快速增长使应用服务提供商能够部署具有严格延迟和高带宽要求的各种服务。这些平台的一个关键优势是,它们通过短期合同向客户收取与其资源使用量成比例的费用,从而提供了现收现付的灵活性。这为客户端提供了显著的成本节约机会,通过动态决定何时在平台上托管其服务,这取决于不断变化的请求强度。我们设置的自然策略是生存时间(TTL)策略。我们表明,TTL在对抗性到达设置中表现不佳,即,在竞争比方面,对于i.i.d.具有低到达率的随机到达,与TTL定时器的值无关。我们提出了一个在线政策称为RetroRenting(RR),并表明,在确定性的在线政策类,RR是订单最优的竞争比。此外,我们还为RR for i.i.d.提供性能保证。随机到达过程加上负相关的租金成本序列,并证明它比较好的最优在线策略。此外,我们使用合成和真实世界的痕迹进行模拟,比较性能的RR与最佳的离线和在线政策。仿真结果表明,RR的性能是接近最佳的所有考虑的设置。我们的结果说明了RR的普遍性。
Multi-Timescale Online Optimization of Network Function Virtualization for Service Chaining
Fudan University(复旦大学);Macquarie University(麦考瑞大学);Commonwealth Scientific and Industrial Research Organization (CSIRO)(联邦科学与工业研究组织);University of Minnesota(明尼苏达大学);University of Technology Sydney(悉尼科技大学)