移动边缘计算的异步在线服务放置和任务卸载

Xin Li, Xinglin Zhang, Tiansheng Huang
{"title":"移动边缘计算的异步在线服务放置和任务卸载","authors":"Xin Li, Xinglin Zhang, Tiansheng Huang","doi":"10.1109/SECON52354.2021.9491595","DOIUrl":null,"url":null,"abstract":"Mobile edge computing (MEC) pushes the centralized cloud resources close to the edge network, which significantly reduces the pressure of the backbone network and meets the requirements of emerging mobile applications. To achieve high performance of the MEC system, it is essential to design efficient task offloading schemes. Many existing works focus on offloading tasks to the edge servers while ignoring the heterogeneity and diversity of computation services, which is also important in MEC. In this paper, we investigate the joint problem of online task offloading and service placement—downloading and deploying the service-related resources at edge servers—in the dense MEC network. Our MEC system aims to maximize the long-term average network utility while maintaining the stability of the edge network. Due to the uncertainty of task demands, it is impossible to make an online long-term optimal decision. Therefore, we propose an online algorithm based on the two-timescale Lyapunov optimization without requiring the future information. By making asynchronous decisions on service placement and task offloading, we can achieve a time-average sub-optimal solution that is close to the offline optimum. In addition, rigorous theoretical analysis and extensive trace-driven experimental results show that the proposed algorithm is more competitive than benchmarks.","PeriodicalId":120945,"journal":{"name":"2021 18th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Asynchronous Online Service Placement and Task Offloading for Mobile Edge Computing\",\"authors\":\"Xin Li, Xinglin Zhang, Tiansheng Huang\",\"doi\":\"10.1109/SECON52354.2021.9491595\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mobile edge computing (MEC) pushes the centralized cloud resources close to the edge network, which significantly reduces the pressure of the backbone network and meets the requirements of emerging mobile applications. To achieve high performance of the MEC system, it is essential to design efficient task offloading schemes. Many existing works focus on offloading tasks to the edge servers while ignoring the heterogeneity and diversity of computation services, which is also important in MEC. In this paper, we investigate the joint problem of online task offloading and service placement—downloading and deploying the service-related resources at edge servers—in the dense MEC network. Our MEC system aims to maximize the long-term average network utility while maintaining the stability of the edge network. Due to the uncertainty of task demands, it is impossible to make an online long-term optimal decision. Therefore, we propose an online algorithm based on the two-timescale Lyapunov optimization without requiring the future information. By making asynchronous decisions on service placement and task offloading, we can achieve a time-average sub-optimal solution that is close to the offline optimum. In addition, rigorous theoretical analysis and extensive trace-driven experimental results show that the proposed algorithm is more competitive than benchmarks.\",\"PeriodicalId\":120945,\"journal\":{\"name\":\"2021 18th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 18th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SECON52354.2021.9491595\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 18th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SECON52354.2021.9491595","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

移动边缘计算(MEC)将集中式云资源推向边缘网络,大大减轻了骨干网的压力,满足了新兴移动应用的需求。为了实现MEC系统的高性能,必须设计有效的任务卸载方案。许多现有的工作都集中在将任务卸载到边缘服务器上,而忽略了计算服务的异质性和多样性,这在MEC中也很重要。本文研究了密集MEC网络中在线任务卸载和服务放置的联合问题,即在边缘服务器上下载和部署与服务相关的资源。我们的MEC系统旨在最大限度地提高长期平均网络效用,同时保持边缘网络的稳定性。由于任务需求的不确定性,不可能做出在线的长期最优决策。因此,我们提出了一种不需要未来信息的基于双时间尺度Lyapunov优化的在线算法。通过对服务放置和任务卸载做出异步决策,我们可以获得接近离线最优的时间平均次最优解决方案。此外,严格的理论分析和广泛的跟踪驱动实验结果表明,所提出的算法比基准更具竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Asynchronous Online Service Placement and Task Offloading for Mobile Edge Computing
Mobile edge computing (MEC) pushes the centralized cloud resources close to the edge network, which significantly reduces the pressure of the backbone network and meets the requirements of emerging mobile applications. To achieve high performance of the MEC system, it is essential to design efficient task offloading schemes. Many existing works focus on offloading tasks to the edge servers while ignoring the heterogeneity and diversity of computation services, which is also important in MEC. In this paper, we investigate the joint problem of online task offloading and service placement—downloading and deploying the service-related resources at edge servers—in the dense MEC network. Our MEC system aims to maximize the long-term average network utility while maintaining the stability of the edge network. Due to the uncertainty of task demands, it is impossible to make an online long-term optimal decision. Therefore, we propose an online algorithm based on the two-timescale Lyapunov optimization without requiring the future information. By making asynchronous decisions on service placement and task offloading, we can achieve a time-average sub-optimal solution that is close to the offline optimum. In addition, rigorous theoretical analysis and extensive trace-driven experimental results show that the proposed algorithm is more competitive than benchmarks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信