考虑边缘计算网络中群体合作拓扑特征的多边缘联合卸载方法

IF 3.3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Zengwei Lyu, Pengfei Li, Zhenchun Wei, Yuqi Fan, Juan Xu, Lei Shi
{"title":"考虑边缘计算网络中群体合作拓扑特征的多边缘联合卸载方法","authors":"Zengwei Lyu, Pengfei Li, Zhenchun Wei, Yuqi Fan, Juan Xu, Lei Shi","doi":"10.1007/s12083-024-01766-z","DOIUrl":null,"url":null,"abstract":"<p>Mobile Edge Computing (MEC) is a new computing paradigm that has shown great potential. How to extract the cooperative topological relationship between MEC servers to realize jointly computing is the key problem to solve the bottleneck of MEC computational capability. In previous studies, multi-MEC servers are regarded as unit computing nodes with the same cooperation relationship to jointly schedule offloading tasks, without considering the hierarchical and clustered topology of the server collaborative work. As a result, in the scenario of unbalanced distribution of computing resources, it is difficult to obtain the optimal joint scheduling strategy for offloading tasks according to the cooperation relationship and resource differences among MEC servers. Therefore, this paper considers introducing the topological relationship of group cooperation among multi-MEC servers to optimize the joint scheduling strategy, and proposes a Multi-Agent Hierarchical Graph Attention Soft Actor-Critic algorithm (MHSAC). Firstly, based on the differences in their own resources and the demands of the tasks they undertake, MEC servers are divided into series clusters. Then, a Hierarchical Graph Attention Network (HGAT) is used to model each agent to extract the physical communication topology information of the MEC server and the group topology information of multi-edge cooperation. The multi-agent soft Actor-Critic algorithm is used to obtain the offloading scheduling decision of multi-edge cooperation. Experiments show that the MHSAC algorithm that considering the topological relationship of multi-edge group cooperation can optimize load distribution under low latency and resource-limited requirements, achieving optimal load balancing values and task drop rates.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"194 1","pages":""},"PeriodicalIF":3.3000,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A multi-edge jointly offloading method considering group cooperation topology features in edge computing networks\",\"authors\":\"Zengwei Lyu, Pengfei Li, Zhenchun Wei, Yuqi Fan, Juan Xu, Lei Shi\",\"doi\":\"10.1007/s12083-024-01766-z\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Mobile Edge Computing (MEC) is a new computing paradigm that has shown great potential. How to extract the cooperative topological relationship between MEC servers to realize jointly computing is the key problem to solve the bottleneck of MEC computational capability. In previous studies, multi-MEC servers are regarded as unit computing nodes with the same cooperation relationship to jointly schedule offloading tasks, without considering the hierarchical and clustered topology of the server collaborative work. As a result, in the scenario of unbalanced distribution of computing resources, it is difficult to obtain the optimal joint scheduling strategy for offloading tasks according to the cooperation relationship and resource differences among MEC servers. Therefore, this paper considers introducing the topological relationship of group cooperation among multi-MEC servers to optimize the joint scheduling strategy, and proposes a Multi-Agent Hierarchical Graph Attention Soft Actor-Critic algorithm (MHSAC). Firstly, based on the differences in their own resources and the demands of the tasks they undertake, MEC servers are divided into series clusters. Then, a Hierarchical Graph Attention Network (HGAT) is used to model each agent to extract the physical communication topology information of the MEC server and the group topology information of multi-edge cooperation. The multi-agent soft Actor-Critic algorithm is used to obtain the offloading scheduling decision of multi-edge cooperation. Experiments show that the MHSAC algorithm that considering the topological relationship of multi-edge group cooperation can optimize load distribution under low latency and resource-limited requirements, achieving optimal load balancing values and task drop rates.</p>\",\"PeriodicalId\":49313,\"journal\":{\"name\":\"Peer-To-Peer Networking and Applications\",\"volume\":\"194 1\",\"pages\":\"\"},\"PeriodicalIF\":3.3000,\"publicationDate\":\"2024-07-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Peer-To-Peer Networking and Applications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s12083-024-01766-z\",\"RegionNum\":4,\"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":"Peer-To-Peer Networking and Applications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s12083-024-01766-z","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

移动边缘计算(MEC)是一种新的计算模式,已显示出巨大的潜力。如何提取 MEC 服务器之间的协同拓扑关系实现联合计算,是解决 MEC 计算能力瓶颈的关键问题。在以往的研究中,多台 MEC 服务器被视为具有相同协作关系的单元计算节点来联合调度卸载任务,而没有考虑服务器协作工作的分层和集群拓扑结构。因此,在计算资源分布不均衡的情况下,很难根据 MEC 服务器之间的合作关系和资源差异获得卸载任务的最优联合调度策略。因此,本文考虑引入多MEC服务器之间的群体合作拓扑关系来优化联合调度策略,并提出了一种多代理分层图注意软代理批判算法(MHSAC)。首先,根据MEC服务器自身资源和所承担任务需求的差异,将MEC服务器划分为系列集群。然后,利用层次图注意力网络(HGAT)为每个代理建模,提取 MEC 服务器的物理通信拓扑信息和多边缘合作的组拓扑信息。采用多代理软代理批判算法获得多边缘合作的卸载调度决策。实验表明,考虑多边缘群合作拓扑关系的 MHSAC 算法能在低延迟和资源有限的要求下优化负载分配,实现最优负载均衡值和任务丢弃率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

A multi-edge jointly offloading method considering group cooperation topology features in edge computing networks

A multi-edge jointly offloading method considering group cooperation topology features in edge computing networks

Mobile Edge Computing (MEC) is a new computing paradigm that has shown great potential. How to extract the cooperative topological relationship between MEC servers to realize jointly computing is the key problem to solve the bottleneck of MEC computational capability. In previous studies, multi-MEC servers are regarded as unit computing nodes with the same cooperation relationship to jointly schedule offloading tasks, without considering the hierarchical and clustered topology of the server collaborative work. As a result, in the scenario of unbalanced distribution of computing resources, it is difficult to obtain the optimal joint scheduling strategy for offloading tasks according to the cooperation relationship and resource differences among MEC servers. Therefore, this paper considers introducing the topological relationship of group cooperation among multi-MEC servers to optimize the joint scheduling strategy, and proposes a Multi-Agent Hierarchical Graph Attention Soft Actor-Critic algorithm (MHSAC). Firstly, based on the differences in their own resources and the demands of the tasks they undertake, MEC servers are divided into series clusters. Then, a Hierarchical Graph Attention Network (HGAT) is used to model each agent to extract the physical communication topology information of the MEC server and the group topology information of multi-edge cooperation. The multi-agent soft Actor-Critic algorithm is used to obtain the offloading scheduling decision of multi-edge cooperation. Experiments show that the MHSAC algorithm that considering the topological relationship of multi-edge group cooperation can optimize load distribution under low latency and resource-limited requirements, achieving optimal load balancing values and task drop rates.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Peer-To-Peer Networking and Applications
Peer-To-Peer Networking and Applications COMPUTER SCIENCE, INFORMATION SYSTEMS-TELECOMMUNICATIONS
CiteScore
8.00
自引率
7.10%
发文量
145
审稿时长
12 months
期刊介绍: The aim of the Peer-to-Peer Networking and Applications journal is to disseminate state-of-the-art research and development results in this rapidly growing research area, to facilitate the deployment of P2P networking and applications, and to bring together the academic and industry communities, with the goal of fostering interaction to promote further research interests and activities, thus enabling new P2P applications and services. The journal not only addresses research topics related to networking and communications theory, but also considers the standardization, economic, and engineering aspects of P2P technologies, and their impacts on software engineering, computer engineering, networked communication, and security. The journal serves as a forum for tackling the technical problems arising from both file sharing and media streaming applications. It also includes state-of-the-art technologies in the P2P security domain. Peer-to-Peer Networking and Applications publishes regular papers, tutorials and review papers, case studies, and correspondence from the research, development, and standardization communities. Papers addressing system, application, and service issues are encouraged.
×
引用
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学术官方微信