针对边缘计算的可靠自适应计算卸载策略与负载和成本协调

IF 3 3区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pervasive and Mobile Computing Pub Date : 2024-04-30 DOI:10.1016/j.pmcj.2024.101932
Weicheng Tang , Donghui Gao , Siyu Yu , Jianbo Lu , Zhiyong Wei , Zhanrong Li , Ningjiang Chen
{"title":"针对边缘计算的可靠自适应计算卸载策略与负载和成本协调","authors":"Weicheng Tang ,&nbsp;Donghui Gao ,&nbsp;Siyu Yu ,&nbsp;Jianbo Lu ,&nbsp;Zhiyong Wei ,&nbsp;Zhanrong Li ,&nbsp;Ningjiang Chen","doi":"10.1016/j.pmcj.2024.101932","DOIUrl":null,"url":null,"abstract":"<div><p>There are several important factors to consider in edge computing systems including latency, reliability, power consumption, and queue load. Task replication requires additional energy costs in mobile edge offloading scenarios based on master-slave replication for fault tolerance. Excessive task offloading may lead to a sharp increase in the total energy consumption of the system including replication costs. Conversely, new tasks cannot enter the waiting queue and are lost, resulting in reliability issues. This paper proposes an adaptive task offloading strategy for balancing the edge node queue load and offloading cost (Lyapunov and Differential Evolution based Offloading schedule strategy, LDEO). The LDEO strategy innovatively customizes the Lyapunov drift-plus-penalty function by incorporating replication redundancy offloading costs to establish a balance model between the queue load and offloading cost. The LDEO strategy computes the optimal offloading decisions with dynamic adjustment characteristics by integrating a low-complexity differential evolution method, aiming to find the optimal balance point that minimizes the offloading cost while maintaining reliability performance. The experimental results show that compared with the existing strategies, LDEO strategy effectively reduces the redundancy of fault tolerance cost and the waiting time under the condition of ensuring that the task will not be discarded over time. It stabilizes the queue length in a reasonable range, controls the waiting time and loss rate of tasks, reduces the extra energy consumption paid by replication redundancy, and effectively realizes the optimal balance under multiple conditions.</p></div>","PeriodicalId":49005,"journal":{"name":"Pervasive and Mobile Computing","volume":"102 ","pages":"Article 101932"},"PeriodicalIF":3.0000,"publicationDate":"2024-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Reliable and adaptive computation offload strategy with load and cost coordination for edge computing\",\"authors\":\"Weicheng Tang ,&nbsp;Donghui Gao ,&nbsp;Siyu Yu ,&nbsp;Jianbo Lu ,&nbsp;Zhiyong Wei ,&nbsp;Zhanrong Li ,&nbsp;Ningjiang Chen\",\"doi\":\"10.1016/j.pmcj.2024.101932\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>There are several important factors to consider in edge computing systems including latency, reliability, power consumption, and queue load. Task replication requires additional energy costs in mobile edge offloading scenarios based on master-slave replication for fault tolerance. Excessive task offloading may lead to a sharp increase in the total energy consumption of the system including replication costs. Conversely, new tasks cannot enter the waiting queue and are lost, resulting in reliability issues. This paper proposes an adaptive task offloading strategy for balancing the edge node queue load and offloading cost (Lyapunov and Differential Evolution based Offloading schedule strategy, LDEO). The LDEO strategy innovatively customizes the Lyapunov drift-plus-penalty function by incorporating replication redundancy offloading costs to establish a balance model between the queue load and offloading cost. The LDEO strategy computes the optimal offloading decisions with dynamic adjustment characteristics by integrating a low-complexity differential evolution method, aiming to find the optimal balance point that minimizes the offloading cost while maintaining reliability performance. The experimental results show that compared with the existing strategies, LDEO strategy effectively reduces the redundancy of fault tolerance cost and the waiting time under the condition of ensuring that the task will not be discarded over time. It stabilizes the queue length in a reasonable range, controls the waiting time and loss rate of tasks, reduces the extra energy consumption paid by replication redundancy, and effectively realizes the optimal balance under multiple conditions.</p></div>\",\"PeriodicalId\":49005,\"journal\":{\"name\":\"Pervasive and Mobile Computing\",\"volume\":\"102 \",\"pages\":\"Article 101932\"},\"PeriodicalIF\":3.0000,\"publicationDate\":\"2024-04-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Pervasive and Mobile Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1574119224000580\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pervasive and Mobile Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1574119224000580","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

边缘计算系统需要考虑几个重要因素,包括延迟、可靠性、功耗和队列负载。在基于主从复制容错的移动边缘卸载场景中,任务复制需要额外的能源成本。过度的任务卸载可能会导致系统总能耗(包括复制成本)急剧增加。相反,新任务无法进入等待队列而丢失,从而导致可靠性问题。本文提出了一种平衡边缘节点队列负载和卸载成本的自适应任务卸载策略(基于 Lyapunov 和差分进化的卸载计划策略,LDEO)。LDEO 策略通过结合复制冗余卸载成本,创新性地定制了 Lyapunov 漂移加惩罚函数,从而建立了队列负载与卸载成本之间的平衡模型。LDEO 策略通过集成低复杂度的微分演化方法,计算出具有动态调整特性的最优卸载决策,旨在找到最优平衡点,在保持可靠性能的同时使卸载成本最小。实验结果表明,与现有的策略相比,LDEO 策略在保证任务不被长期丢弃的前提下,有效降低了容错成本的冗余度,减少了等待时间。它将队列长度稳定在合理范围内,控制了任务的等待时间和丢失率,减少了复制冗余付出的额外能耗,有效实现了多种条件下的最优平衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Reliable and adaptive computation offload strategy with load and cost coordination for edge computing

There are several important factors to consider in edge computing systems including latency, reliability, power consumption, and queue load. Task replication requires additional energy costs in mobile edge offloading scenarios based on master-slave replication for fault tolerance. Excessive task offloading may lead to a sharp increase in the total energy consumption of the system including replication costs. Conversely, new tasks cannot enter the waiting queue and are lost, resulting in reliability issues. This paper proposes an adaptive task offloading strategy for balancing the edge node queue load and offloading cost (Lyapunov and Differential Evolution based Offloading schedule strategy, LDEO). The LDEO strategy innovatively customizes the Lyapunov drift-plus-penalty function by incorporating replication redundancy offloading costs to establish a balance model between the queue load and offloading cost. The LDEO strategy computes the optimal offloading decisions with dynamic adjustment characteristics by integrating a low-complexity differential evolution method, aiming to find the optimal balance point that minimizes the offloading cost while maintaining reliability performance. The experimental results show that compared with the existing strategies, LDEO strategy effectively reduces the redundancy of fault tolerance cost and the waiting time under the condition of ensuring that the task will not be discarded over time. It stabilizes the queue length in a reasonable range, controls the waiting time and loss rate of tasks, reduces the extra energy consumption paid by replication redundancy, and effectively realizes the optimal balance under multiple conditions.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Pervasive and Mobile Computing
Pervasive and Mobile Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-TELECOMMUNICATIONS
CiteScore
7.70
自引率
2.30%
发文量
80
审稿时长
68 days
期刊介绍: As envisioned by Mark Weiser as early as 1991, pervasive computing systems and services have truly become integral parts of our daily lives. Tremendous developments in a multitude of technologies ranging from personalized and embedded smart devices (e.g., smartphones, sensors, wearables, IoTs, etc.) to ubiquitous connectivity, via a variety of wireless mobile communications and cognitive networking infrastructures, to advanced computing techniques (including edge, fog and cloud) and user-friendly middleware services and platforms have significantly contributed to the unprecedented advances in pervasive and mobile computing. Cutting-edge applications and paradigms have evolved, such as cyber-physical systems and smart environments (e.g., smart city, smart energy, smart transportation, smart healthcare, etc.) that also involve human in the loop through social interactions and participatory and/or mobile crowd sensing, for example. The goal of pervasive computing systems is to improve human experience and quality of life, without explicit awareness of the underlying communications and computing technologies. The Pervasive and Mobile Computing Journal (PMC) is a high-impact, peer-reviewed technical journal that publishes high-quality scientific articles spanning theory and practice, and covering all aspects of pervasive and mobile computing and systems.
期刊最新文献
Collective victim counting in post-disaster response: A distributed, power-efficient algorithm via BLE spontaneous networks Editorial Board Three-dimensional spectrum coverage gap map construction in cellular networks: A non-linear estimation approach Blockchain-Inspired Trust Management in Cognitive Radio Networks with Cooperative Spectrum Sensing Delay-aware resource allocation for partial computation offloading in mobile edge cloud computing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1