MEC-Enabled Task Replication With Resource Allocation for Reliability-Sensitive Services in 5G mMTC Networks

IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Rui Huang;Wushao Wen;Zhi Zhou;Chongwu Dong;Xu Chen
{"title":"MEC-Enabled Task Replication With Resource Allocation for Reliability-Sensitive Services in 5G mMTC Networks","authors":"Rui Huang;Wushao Wen;Zhi Zhou;Chongwu Dong;Xu Chen","doi":"10.1109/TSC.2024.3517341","DOIUrl":null,"url":null,"abstract":"The increasing demand for connectivity in 5G networks has led to a focus on massive machine-type communication (mMTC) in mobile edge computing (MEC) for IoTs. However, the proliferation of IoT devices has resulted in densely deployed networks and led to a high volume of task offloading to the same edge servers simultaneously. As a consequence, mMTC applications may experience service congestion, negatively impacting service reliability. To enhance the service reliability of latency-sensitive applications, task replication with resource allocation is proposed in MEC, in which a task can be sent simultaneously to multiple computing nodes. Task replication can reduce task latency and improve service reliability at the cost of consuming more computation resources. However, unconstrained task replication may result in too many uploading links, leading to severe costs in network operation. To handle the above challenge, we propose a constrained stochastic optimization problem by task replication with wireless resource block (RB) allocation and edge server queue management. To ensure queue stability while minimizing cost, we design one strategy based on the Lyapunov optimization framework. Accordingly, we further model RB allocation as a mean-field game (MFG) due to the intensive coupling of the RB pool for massive users. Tractable partial differential equations are used to analyze MFG equilibrium, and we derive the optimal edge server queue management based on a given task replication strategy and RB allocation scheme. Our theoretical analysis demonstrates that our algorithm closely approaches the optimal overall costs within a small gap, and simulation results show that our strategy generates a significantly lower cumulative cost than other alternative strategies.","PeriodicalId":13255,"journal":{"name":"IEEE Transactions on Services Computing","volume":"18 1","pages":"253-269"},"PeriodicalIF":5.5000,"publicationDate":"2024-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Services Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10797676/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The increasing demand for connectivity in 5G networks has led to a focus on massive machine-type communication (mMTC) in mobile edge computing (MEC) for IoTs. However, the proliferation of IoT devices has resulted in densely deployed networks and led to a high volume of task offloading to the same edge servers simultaneously. As a consequence, mMTC applications may experience service congestion, negatively impacting service reliability. To enhance the service reliability of latency-sensitive applications, task replication with resource allocation is proposed in MEC, in which a task can be sent simultaneously to multiple computing nodes. Task replication can reduce task latency and improve service reliability at the cost of consuming more computation resources. However, unconstrained task replication may result in too many uploading links, leading to severe costs in network operation. To handle the above challenge, we propose a constrained stochastic optimization problem by task replication with wireless resource block (RB) allocation and edge server queue management. To ensure queue stability while minimizing cost, we design one strategy based on the Lyapunov optimization framework. Accordingly, we further model RB allocation as a mean-field game (MFG) due to the intensive coupling of the RB pool for massive users. Tractable partial differential equations are used to analyze MFG equilibrium, and we derive the optimal edge server queue management based on a given task replication strategy and RB allocation scheme. Our theoretical analysis demonstrates that our algorithm closely approaches the optimal overall costs within a small gap, and simulation results show that our strategy generates a significantly lower cumulative cost than other alternative strategies.
5g mMTC网络中支持mec的任务复制和资源分配
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Services Computing
IEEE Transactions on Services Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
11.50
自引率
6.20%
发文量
278
审稿时长
>12 weeks
期刊介绍: IEEE Transactions on Services Computing encompasses the computing and software aspects of the science and technology of services innovation research and development. It places emphasis on algorithmic, mathematical, statistical, and computational methods central to services computing. Topics covered include Service Oriented Architecture, Web Services, Business Process Integration, Solution Performance Management, and Services Operations and Management. The transactions address mathematical foundations, security, privacy, agreement, contract, discovery, negotiation, collaboration, and quality of service for web services. It also covers areas like composite web service creation, business and scientific applications, standards, utility models, business process modeling, integration, collaboration, and more in the realm of Services Computing.
×
引用
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学术官方微信