Task offloading framework to meet resiliency demand in mobile edge computing system

IF 3.8 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Aakansha Garg , Rajeev Arya , Maheshwari Prasad Singh
{"title":"Task offloading framework to meet resiliency demand in mobile edge computing system","authors":"Aakansha Garg ,&nbsp;Rajeev Arya ,&nbsp;Maheshwari Prasad Singh","doi":"10.1016/j.suscom.2024.101018","DOIUrl":null,"url":null,"abstract":"<div><p>With the development of 5 G mobile users are increasing massively. Some mobile applications like healthcare are latency-critical and requires real-time data processing. A preference-based task offloading framework in mobile edge computing with a device-to-device offloading (MECD2D) system has been proposed to fulfill the latency demands of such applications for minimum energy consumption ensuring resiliency. The problem is formulated as a constraint-based non-linear optimization problem which is complex. The resources are allocated in two steps. In the first step, resources are allocated based on latency demand to ensure resiliency. In the second step, allocated resources are optimized using a non-cooperative mean field game for dynamic system. To ensure the performance of the system for dynamic network, the results are executed on a real-time Shanghai dataset. The computational results indicate that the proposed algorithm performs better in terms of energy consumption. Other parameters such as throughput, network utilization and task computation are also analysed. The results are verified by performing the proposed algorithm with existing Q learning and mean-field game algorithms. The results performed on the dataset indicate an improvement in energy consumption by 5–10 %, and 10–50 % as compared to Q learning and mean-field game respectively.</p></div>","PeriodicalId":48686,"journal":{"name":"Sustainable Computing-Informatics & Systems","volume":"43 ","pages":"Article 101018"},"PeriodicalIF":3.8000,"publicationDate":"2024-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sustainable Computing-Informatics & Systems","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210537924000635","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

With the development of 5 G mobile users are increasing massively. Some mobile applications like healthcare are latency-critical and requires real-time data processing. A preference-based task offloading framework in mobile edge computing with a device-to-device offloading (MECD2D) system has been proposed to fulfill the latency demands of such applications for minimum energy consumption ensuring resiliency. The problem is formulated as a constraint-based non-linear optimization problem which is complex. The resources are allocated in two steps. In the first step, resources are allocated based on latency demand to ensure resiliency. In the second step, allocated resources are optimized using a non-cooperative mean field game for dynamic system. To ensure the performance of the system for dynamic network, the results are executed on a real-time Shanghai dataset. The computational results indicate that the proposed algorithm performs better in terms of energy consumption. Other parameters such as throughput, network utilization and task computation are also analysed. The results are verified by performing the proposed algorithm with existing Q learning and mean-field game algorithms. The results performed on the dataset indicate an improvement in energy consumption by 5–10 %, and 10–50 % as compared to Q learning and mean-field game respectively.

满足移动边缘计算系统弹性需求的任务卸载框架
随着 5 G 移动技术的发展,移动用户正在大量增加。一些移动应用(如医疗保健)对延迟要求很高,需要实时数据处理。在移动边缘计算中提出了一种基于偏好的任务卸载框架,即设备到设备卸载(MECD2D)系统,以满足这类应用对延迟的要求,同时确保最低能耗和弹性。该问题被表述为一个复杂的基于约束的非线性优化问题。资源分配分为两步。第一步,根据延迟需求分配资源,以确保弹性。第二步,利用动态系统的非合作均值场博弈对分配的资源进行优化。为确保系统在动态网络中的性能,在上海实时数据集上执行了计算结果。计算结果表明,所提出的算法在能耗方面表现更好。此外,还分析了吞吐量、网络利用率和任务计算量等其他参数。通过将提出的算法与现有的 Q 学习算法和均场博弈算法进行比较,对结果进行了验证。数据集上的结果表明,与 Q 学习算法和均值场博弈算法相比,该算法的能耗分别降低了 5%-10%和 10%-50%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Sustainable Computing-Informatics & Systems
Sustainable Computing-Informatics & Systems COMPUTER SCIENCE, HARDWARE & ARCHITECTUREC-COMPUTER SCIENCE, INFORMATION SYSTEMS
CiteScore
10.70
自引率
4.40%
发文量
142
期刊介绍: Sustainable computing is a rapidly expanding research area spanning the fields of computer science and engineering, electrical engineering as well as other engineering disciplines. The aim of Sustainable Computing: Informatics and Systems (SUSCOM) is to publish the myriad research findings related to energy-aware and thermal-aware management of computing resource. Equally important is a spectrum of related research issues such as applications of computing that can have ecological and societal impacts. SUSCOM publishes original and timely research papers and survey articles in current areas of power, energy, temperature, and environment related research areas of current importance to readers. SUSCOM has an editorial board comprising prominent researchers from around the world and selects competitively evaluated peer-reviewed papers.
×
引用
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学术官方微信