Two-timescale joint service caching and resource allocation for task offloading with edge–cloud cooperation

IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
{"title":"Two-timescale joint service caching and resource allocation for task offloading with edge–cloud cooperation","authors":"","doi":"10.1016/j.comnet.2024.110771","DOIUrl":null,"url":null,"abstract":"<div><p>Task offloading with edge–cloud cooperation has emerged as a pivotal solution for meeting the intricate array of application coupled with dynamically evolving business demand in 6G business scenarios, such as traffic sensing, environmental monitoring, and video surveillance in smart cities. Nonetheless, effectively leveraging heterogeneous edge–cloud network resources for effective task offloading presents substantial challenges. Additionally, the inherent differences in system decision cycles escalate the complexity of the task offloading problem to a new dimension. In this study, we delve into a two-timescale joint service caching and resource allocation optimization for task offloading within edge–cloud cooperation aiming to maximize long-term network performance while adhering to energy constraints. We propose a novel edge–cloud cooperation task offloading scheme that supports both edge–cloud and edge–edge cooperation to effectively balance the edge–cloud and edge–edge loads, promoting the efficient co-utilization of all edge–cloud system resources. Furthermore, we devise an online two-timescale Lyapunov-based joint optimization framework for service caching, task offloading, and computing resource allocation. Our two-timescale decision-making framework can flexibly accommodate the inherent differences in the sensitive decision optimization periods, thereby mitigating the degradation of task offloading performance caused by frequent service caching updates. Finally, theoretical analysis confirms that our proposed algorithm can converge to an approximate optimal solution in polynomial time, and the superiority of our scheme is validated by extensive simulation experiments.</p></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4000,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128624006030","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

Task offloading with edge–cloud cooperation has emerged as a pivotal solution for meeting the intricate array of application coupled with dynamically evolving business demand in 6G business scenarios, such as traffic sensing, environmental monitoring, and video surveillance in smart cities. Nonetheless, effectively leveraging heterogeneous edge–cloud network resources for effective task offloading presents substantial challenges. Additionally, the inherent differences in system decision cycles escalate the complexity of the task offloading problem to a new dimension. In this study, we delve into a two-timescale joint service caching and resource allocation optimization for task offloading within edge–cloud cooperation aiming to maximize long-term network performance while adhering to energy constraints. We propose a novel edge–cloud cooperation task offloading scheme that supports both edge–cloud and edge–edge cooperation to effectively balance the edge–cloud and edge–edge loads, promoting the efficient co-utilization of all edge–cloud system resources. Furthermore, we devise an online two-timescale Lyapunov-based joint optimization framework for service caching, task offloading, and computing resource allocation. Our two-timescale decision-making framework can flexibly accommodate the inherent differences in the sensitive decision optimization periods, thereby mitigating the degradation of task offloading performance caused by frequent service caching updates. Finally, theoretical analysis confirms that our proposed algorithm can converge to an approximate optimal solution in polynomial time, and the superiority of our scheme is validated by extensive simulation experiments.

利用边缘-云合作实现任务卸载的双倍规模联合服务缓存和资源分配
在 6G 业务场景中,如智慧城市中的交通传感、环境监测和视频监控等,要满足错综复杂的应用和动态演进的业务需求,边缘-云合作的任务卸载已成为一种关键的解决方案。然而,有效利用异构边缘云网络资源以实现有效的任务卸载面临着巨大挑战。此外,系统决策周期的固有差异将任务卸载问题的复杂性提升到了一个新的维度。在本研究中,我们深入研究了边缘云合作中任务卸载的双时标联合服务缓存和资源分配优化,旨在最大限度地提高长期网络性能,同时遵守能源约束。我们提出了一种新颖的边缘-云合作任务卸载方案,该方案同时支持边缘-云合作和边缘-边缘合作,可有效平衡边缘-云和边缘-边缘负载,促进所有边缘-云系统资源的高效协同利用。此外,我们还为服务缓存、任务卸载和计算资源分配设计了基于 Lyapunov 的在线双时标联合优化框架。我们的双时间尺度决策框架可以灵活地适应敏感决策优化期的内在差异,从而减轻频繁的服务缓存更新对任务卸载性能造成的降低。最后,理论分析证实,我们提出的算法可以在多项式时间内收敛到近似最优解,大量的仿真实验也验证了我们方案的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信