Joint Task Coding and Transfer Optimization for Edge Computing Power Networks

IF 6.7 2区 计算机科学 Q1 ENGINEERING, MULTIDISCIPLINARY
Jiajia Liu;Yunlong Lu;Hao Wu;Bo Ai;Abbas Jamalipour;Yan Zhang
{"title":"Joint Task Coding and Transfer Optimization for Edge Computing Power Networks","authors":"Jiajia Liu;Yunlong Lu;Hao Wu;Bo Ai;Abbas Jamalipour;Yan Zhang","doi":"10.1109/TNSE.2025.3554100","DOIUrl":null,"url":null,"abstract":"Driven by the exponential growth of the Internet of Everything (IoE) and substantial advancements in artificial intelligence, services based on deep learning have seen a significant increase in demand for computing resources. The existing edge computing paradigms struggle to handle the explosive growth in computing demands. They also face challenges in jointly optimizing the high transmission load and privacy concerns of task collaboration while failing to utilize computing resources efficiently in complex and dynamic computing power networks. In this paper, we investigate an edge computing power network framework that integrates heterogeneous computing resources from both horizontal and vertical dimensions. We formulate a collaborative task transfer problem to minimize the total execution time of multiple tasks by joint optimization task coding, computing-task association, and collaborative transfer computing strategies among nodes. To solve the formulated problem, we conduct in-depth theoretical analyses and design a two-layer multi-agent optimization algorithm. Specifically, the task coding problem is reformulated in the inner layer into a solvable form, and a closed-form expression for the task coding ratio is derived. Subsequently, we design an adaptive hybrid reward-based multi-agent deep reinforcement learning algorithm to address the sparsity challenges of single-layer rewards while ensuring efficient and stable training convergence. Numerical results show the superiority of our proposed algorithm.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"2783-2796"},"PeriodicalIF":6.7000,"publicationDate":"2025-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10938294/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

Driven by the exponential growth of the Internet of Everything (IoE) and substantial advancements in artificial intelligence, services based on deep learning have seen a significant increase in demand for computing resources. The existing edge computing paradigms struggle to handle the explosive growth in computing demands. They also face challenges in jointly optimizing the high transmission load and privacy concerns of task collaboration while failing to utilize computing resources efficiently in complex and dynamic computing power networks. In this paper, we investigate an edge computing power network framework that integrates heterogeneous computing resources from both horizontal and vertical dimensions. We formulate a collaborative task transfer problem to minimize the total execution time of multiple tasks by joint optimization task coding, computing-task association, and collaborative transfer computing strategies among nodes. To solve the formulated problem, we conduct in-depth theoretical analyses and design a two-layer multi-agent optimization algorithm. Specifically, the task coding problem is reformulated in the inner layer into a solvable form, and a closed-form expression for the task coding ratio is derived. Subsequently, we design an adaptive hybrid reward-based multi-agent deep reinforcement learning algorithm to address the sparsity challenges of single-layer rewards while ensuring efficient and stable training convergence. Numerical results show the superiority of our proposed algorithm.
边缘计算能力网络的联合任务编码与传输优化
在万物互联(IoE)的指数级增长和人工智能的实质性进步的推动下,基于深度学习的服务对计算资源的需求显著增加。现有的边缘计算范式难以处理计算需求的爆炸性增长。在复杂、动态的计算能力网络中,它们还面临着共同优化任务协作的高传输负载和隐私问题,以及无法有效利用计算资源的挑战。在本文中,我们研究了一个边缘计算能力网络框架,该框架从水平和垂直两个维度集成了异构计算资源。通过联合优化任务编码、计算任务关联和节点间协同转移计算策略,提出了一个最小化多任务总执行时间的协同任务转移问题。为了解决公式化问题,我们进行了深入的理论分析,并设计了一种双层多智能体优化算法。具体而言,在内层将任务编码问题重新表述为可解形式,并推导出任务编码比的封闭形式表达式。随后,我们设计了一种基于自适应混合奖励的多智能体深度强化学习算法,以解决单层奖励的稀疏性挑战,同时保证高效稳定的训练收敛。数值结果表明了该算法的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Network Science and Engineering
IEEE Transactions on Network Science and Engineering Engineering-Control and Systems Engineering
CiteScore
12.60
自引率
9.10%
发文量
393
期刊介绍: The proposed journal, called the IEEE Transactions on Network Science and Engineering (TNSE), is committed to timely publishing of peer-reviewed technical articles that deal with the theory and applications of network science and the interconnections among the elements in a system that form a network. In particular, the IEEE Transactions on Network Science and Engineering publishes articles on understanding, prediction, and control of structures and behaviors of networks at the fundamental level. The types of networks covered include physical or engineered networks, information networks, biological networks, semantic networks, economic networks, social networks, and ecological networks. Aimed at discovering common principles that govern network structures, network functionalities and behaviors of networks, the journal seeks articles on understanding, prediction, and control of structures and behaviors of networks. Another trans-disciplinary focus of the IEEE Transactions on Network Science and Engineering is the interactions between and co-evolution of different genres of networks.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信