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

为服务托管租赁边缘计算资源

Renting Edge Computing Resources for Service Hosting

Aadesh Madnaik, Sharayu Moharir, Nikhil Karamchandani

AI总结:

针对边缘服务托管场景下的动态资源租赁决策难题,提出一种确定性在线策略,推导了确定性策略的性能下界,验证其对请求到达强度变化具有鲁棒性。

摘要:

我们研究如下场景:一项服务托管在部署于用户附近的第三方边缘服务器,以及一台距离用户更远的云服务器上。由于边缘服务器靠近用户,请求可在边缘以低延迟得到处理。但边缘的计算资源有限,部分请求必须被路由到云端处理,从而产生高延迟。系统的整体性能取决于使用边缘服务器产生的租赁成本、用户体验到的延迟,以及随时间调整边缘计算资源租赁量产生的变更成本。算法层面的挑战在于确定随时间变化的边缘计算能力租赁量。我们提出了一种确定性在线策略,并针对对抗性请求到达过程和随机独立同分布(i.i.d.)请求到达过程,刻画了该策略的性能。我们还推导了任意确定性在线策略性能的基本下界。此外,我们将该策略的性能与现有策略的适当修改版本进行了比较,结果表明我们的策略对请求到达强度的时间变化具有鲁棒性。

英文摘要:

We consider the setting where a service is hosted on a third-party edge server deployed close to the users and a cloud server at a greater distance from the users. Due to the proximity of the edge servers to the users, requests can be served at the edge with low latency. However, as the computation resources at the edge are limited, some requests must be routed to the cloud for service and incur high latency. The system's overall performance depends on the rent cost incurred to use the edge server, the latency experienced by the users, and the cost incurred to change the amount of edge computation resources rented over time. The algorithmic challenge is to determine the amount of edge computation power to rent over time. We propose a deterministic online policy and characterize its performance for adversarial and stochastic i.i.d. request arrival processes. We also characterize a fundamental bound on the performance of any deterministic online policy. Further, we compare the performance of our policy with suitably modified versions of existing policies to conclude that our policy is robust to temporal changes in the intensity of request arrivals.

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

↑