arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2103.00555cs.NI
收藏

边缘在线部分服务托管

Online Partial Service Hosting at the Edge

V S Ch Lakshmi Narayana, Mohit Agarwala, R Sri Prakash, Nikhil Karamchandani, Sharayu Moharir

摘要:

我们考虑服务托管的问题,其中应用程序提供商可以动态地租用边缘计算资源并从边缘服务用户请求,以提供更好的服务质量。这项工作的一个关键新颖之处在于,我们允许服务部分托管在边缘,这使得用户查询的一小部分可以由边缘提供服务。我们将(部分)在边缘托管服务的总成本建模为服务请求的延迟,带宽消耗和租用边缘资源的时变成本的组合。我们提出了一个在线政策称为$α$ -RetroRenting($α$ -RR),动态地确定在任何时隙的边缘托管的服务的分数,根据历史的请求到达和租金成本序列。作为我们的主要结果,我们推导出上界$α$ -RR的竞争比相对于离线最优策略,知道整个请求到达和租金成本序列提前。我们进行了广泛的数值评估,比较性能的$α$ -RR与各种基准的合成和基于跟踪的请求到达和租金成本的过程中,并找到几个参数制度,其中$α$ -RR的存储服务的能力部分大大提高了成本效益。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑