当前位置: X-MOL 学术Appl. Soft Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Joint optimization of service chain caching and task offloading in mobile edge computing
Applied Soft Computing ( IF 8.7 ) Pub Date : 2021-02-04 , DOI: 10.1016/j.asoc.2021.107142
Kai Peng , Jiangtian Nie , Neeraj Kumar , Chao Cai , Jiawen Kang , Zehui Xiong , Yang Zhang

Caching and offloading in Mobile Edge Computing (MEC) are hot topics recently. Existing caching strategies at the edge ignore the programming ability of edge network and design strategies independently thus network resource is under utilization and the quality of experience (QOE) for end users is far from satisfactory. In this paper, we design intelligently joint caching and offloading strategies under the assumption that applications can be in the form of divisible service chain. Different from common approaches that target on reducing response latency only for users, our system take the leasing cost into consideration thus is more efficient for Application Service Providers (ASP). To fulfill our design, we novelly utilize open Jackson queuing network to formulate this joint optimization problem under long term cost restrictions and design a pipeline of algorithm to search for the optimal solution. More specifically, we design a cost adaptive algorithm derived from Lyapunov drift-plus-penalty function so that the long-term problem can be optimized in the slot-by-slot basis. Moreover, we propose to exploit resource-based utility function and device-number-based relative distance to jointly find optimal caching and offloading scheme. Extensive simulation results demonstrate that our approach can effectively reduce the average service latency of the MEC system and keep a low average leasing cost.



中文翻译:

移动边缘计算中服务链缓存和任务卸载的联合优化

移动边缘计算(MEC)中的缓存和卸载是近期的热门话题。边缘上的现有缓存策略独立地忽略了边缘网络的编程能力和设计策略,因此网络资源得到利用,最终用户的体验质量(QOE)远远不能令人满意。在本文中,我们在应用程序可以采用可分割服务链形式的假设下,设计了智能的联合缓存和卸载策略。与仅旨在减少用户响应延迟的常规方法不同,我们的系统将租赁成本考虑在内,因此对于应用程序服务提供商(ASP)更加有效。为了实现我们的设计,我们新颖地利用开放式Jackson排队网络在长期成本限制下制定了此联合优化问题,并设计了算法管道以寻找最佳解决方案。更具体地说,我们设计了一种基于Lyapunov漂移加罚函数的成本自适应算法,以便可以逐个插槽地优化长期问题。此外,我们建议利用基于资源的效用函数和基于设备号的相对距离来共同找到最佳的缓存和卸载方案。大量的仿真结果表明,我们的方法可以有效地减少MEC系统的平均服务等待时间,并保持较低的平均租赁成本。我们设计了一种基于Lyapunov漂移加罚函数的成本自适应算法,以便可以在逐个时隙的基础上优化长期问题。此外,我们建议利用基于资源的效用函数和基于设备号的相对距离来共同找到最佳的缓存和卸载方案。大量的仿真结果表明,我们的方法可以有效地减少MEC系统的平均服务等待时间,并保持较低的平均租赁成本。我们设计了一种基于Lyapunov漂移加罚函数的成本自适应算法,以便可以在逐个时隙的基础上优化长期问题。此外,我们建议利用基于资源的效用函数和基于设备号的相对距离来共同找到最佳的缓存和卸载方案。大量的仿真结果表明,我们的方法可以有效地减少MEC系统的平均服务等待时间,并保持较低的平均租赁成本。

更新日期:2021-02-10
down
wechat
bug