Cell-Less Offloading of Distributed Learning Tasks in Multi-Access Edge Computing

IF 9.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Mobile Computing Pub Date : 2024-08-13 DOI:10.1109/TMC.2024.3442242
Pengchao Han;Bo Liu;Yejun Liu;Lei Guo
{"title":"Cell-Less Offloading of Distributed Learning Tasks in Multi-Access Edge Computing","authors":"Pengchao Han;Bo Liu;Yejun Liu;Lei Guo","doi":"10.1109/TMC.2024.3442242","DOIUrl":null,"url":null,"abstract":"Multi-access edge computing (MEC) is a powerful technology that facilitates the provision of services to 6G users with ultra-low latency and high reliability, particularly in supporting artificial intelligence (AI) applications that rely on distributed machine learning (DL). However, the mobility of users poses challenges in offloading DL tasks to the MEC networks while ensuring satisfactory delay and blocking rates. Task replication emerges as a promising technique for achieving a cell-less design for mobile users. Nevertheless, existing research overlooks the replication of DL tasks involving multiple subtasks and users, as well as the high resource cost of task replication. Towards this challenge, this paper investigates the Mobility-awarE mulTi-replicA (META) DL task offloading problem in MEC networks. First, we propose a hybrid resource allocation mechanism that allocates resources to a replica with high access probability in a static manner and dynamically allocates resources to replicas with low access probabilities. Then, we develop an access base station (BS) clustering algorithm for each user to determine the optimal number of replicas. Additionally, we propose the META DL task offloading algorithms with proved approximation ratios to minimize the overall resource cost. Through simulations based on generated and real-world mobile users, we demonstrate the effectiveness of our proposed algorithms.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"23 12","pages":"14377-14395"},"PeriodicalIF":9.2000,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Mobile Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10634751/","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

Multi-access edge computing (MEC) is a powerful technology that facilitates the provision of services to 6G users with ultra-low latency and high reliability, particularly in supporting artificial intelligence (AI) applications that rely on distributed machine learning (DL). However, the mobility of users poses challenges in offloading DL tasks to the MEC networks while ensuring satisfactory delay and blocking rates. Task replication emerges as a promising technique for achieving a cell-less design for mobile users. Nevertheless, existing research overlooks the replication of DL tasks involving multiple subtasks and users, as well as the high resource cost of task replication. Towards this challenge, this paper investigates the Mobility-awarE mulTi-replicA (META) DL task offloading problem in MEC networks. First, we propose a hybrid resource allocation mechanism that allocates resources to a replica with high access probability in a static manner and dynamically allocates resources to replicas with low access probabilities. Then, we develop an access base station (BS) clustering algorithm for each user to determine the optimal number of replicas. Additionally, we propose the META DL task offloading algorithms with proved approximation ratios to minimize the overall resource cost. Through simulations based on generated and real-world mobile users, we demonstrate the effectiveness of our proposed algorithms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多接入边缘计算中分布式学习任务的无单元卸载
多接入边缘计算(MEC)是一项功能强大的技术,有助于以超低延迟和高可靠性为 6G 用户提供服务,特别是在支持依赖分布式机器学习(DL)的人工智能(AI)应用方面。然而,用户的移动性给将 DL 任务卸载到 MEC 网络,同时确保令人满意的延迟和阻塞率带来了挑战。任务复制是为移动用户实现无小区设计的一种有前途的技术。然而,现有研究忽视了涉及多个子任务和用户的 DL 任务复制,以及任务复制的高资源成本。为了应对这一挑战,本文研究了 MEC 网络中的移动-夸父-多复制(META)DL 任务卸载问题。首先,我们提出了一种混合资源分配机制,即以静态方式向访问概率高的副本分配资源,并动态地向访问概率低的副本分配资源。然后,我们为每个用户开发了一种接入基站(BS)聚类算法,以确定最佳副本数量。此外,我们还提出了 META DL 任务卸载算法,其近似率已得到证明,可最大限度地降低总体资源成本。通过基于生成和真实移动用户的模拟,我们证明了所提算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Mobile Computing
IEEE Transactions on Mobile Computing 工程技术-电信学
CiteScore
12.90
自引率
2.50%
发文量
403
审稿时长
6.6 months
期刊介绍: IEEE Transactions on Mobile Computing addresses key technical issues related to various aspects of mobile computing. This includes (a) architectures, (b) support services, (c) algorithm/protocol design and analysis, (d) mobile environments, (e) mobile communication systems, (f) applications, and (g) emerging technologies. Topics of interest span a wide range, covering aspects like mobile networks and hosts, mobility management, multimedia, operating system support, power management, online and mobile environments, security, scalability, reliability, and emerging technologies such as wearable computers, body area networks, and wireless sensor networks. The journal serves as a comprehensive platform for advancements in mobile computing research.
期刊最新文献
Multi-Layer Scheduling in Gig Platforms Using a Generative Diffusion Model With Duality Guidance Efficient Detection Framework Adaptation for Edge Computing: A Plug-and-Play Neural Network Toolbox Enabling Edge Deployment Bi-CrowdCache: A Decentralized Game-Theoretic Model for Edge Content Sharing Over Time-Varying Communication Networks Adaptive Decentralized Federated Learning in Energy and Latency Constrained Wireless Networks A Hybrid Model With Bayesian Nonparametric Inference for RF Fingerprint Identification
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1