通过协作式多智能体强化学习实现业务功能链拓扑泛化无需再训练

IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Yintan Ai, Hua Li, Hongwei Ruan, Hanlin Liu, Xianrong Wang
{"title":"通过协作式多智能体强化学习实现业务功能链拓扑泛化无需再训练","authors":"Yintan Ai,&nbsp;Hua Li,&nbsp;Hongwei Ruan,&nbsp;Hanlin Liu,&nbsp;Xianrong Wang","doi":"10.1016/j.comnet.2025.111211","DOIUrl":null,"url":null,"abstract":"<div><div>The accelerating growth in mobile devices, along with advancements in technologies like 5G, IoT, and cloud computing, has driven a rising demand for flexible and diverse network services. Service Function Chaining (SFC) has emerged as a pivotal technique to address these demands, leveraging the capabilities of Software Defined Networking (SDN) and Network Function Virtualization (NFV) to enable dynamic service deployment. However, deploying SFCs across dynamic and heterogeneous network topologies remains a formidable challenge, as current solutions are often constrained by their reliance on specific network structures. In this paper, we propose Topo-G, a novel framework for SFC deployment, built upon Cooperative Multi-Agent Reinforcement Learning (MARL), designed to achieve topology generalization under a <em>“train once, run anywhere”</em> paradigm. Unlike existing methods that necessitate retraining for new network topologies, Topo-G is inherently adaptable, efficiently generalizing across diverse topologies without retraining. The framework leverages a decentralized partially observable Markov decision process (Dec-POMDP) to decouple the routing and placement tasks while preserving their interdependence. By incorporating a shortest-path routing algorithm and a candidate pool selection method for VNF placement, Topo-G efficiently coordinates the decision-making process, independent of the underlying network topology. Extensive experiments demonstrate that Topo-G significantly outperforms existing methods in both deployment efficiency and adaptability across various topologies. Additionally, when retraining is required, Topo-G achieves a marked improvement in convergence speed, further underscoring its potential to enhance the scalability and flexibility of SFC deployment in dynamic, large-scale networks.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"263 ","pages":"Article 111211"},"PeriodicalIF":4.4000,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Achieving topology generalization without retraining in service function chaining through cooperative multi-agent reinforcement learning\",\"authors\":\"Yintan Ai,&nbsp;Hua Li,&nbsp;Hongwei Ruan,&nbsp;Hanlin Liu,&nbsp;Xianrong Wang\",\"doi\":\"10.1016/j.comnet.2025.111211\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The accelerating growth in mobile devices, along with advancements in technologies like 5G, IoT, and cloud computing, has driven a rising demand for flexible and diverse network services. Service Function Chaining (SFC) has emerged as a pivotal technique to address these demands, leveraging the capabilities of Software Defined Networking (SDN) and Network Function Virtualization (NFV) to enable dynamic service deployment. However, deploying SFCs across dynamic and heterogeneous network topologies remains a formidable challenge, as current solutions are often constrained by their reliance on specific network structures. In this paper, we propose Topo-G, a novel framework for SFC deployment, built upon Cooperative Multi-Agent Reinforcement Learning (MARL), designed to achieve topology generalization under a <em>“train once, run anywhere”</em> paradigm. Unlike existing methods that necessitate retraining for new network topologies, Topo-G is inherently adaptable, efficiently generalizing across diverse topologies without retraining. The framework leverages a decentralized partially observable Markov decision process (Dec-POMDP) to decouple the routing and placement tasks while preserving their interdependence. By incorporating a shortest-path routing algorithm and a candidate pool selection method for VNF placement, Topo-G efficiently coordinates the decision-making process, independent of the underlying network topology. Extensive experiments demonstrate that Topo-G significantly outperforms existing methods in both deployment efficiency and adaptability across various topologies. Additionally, when retraining is required, Topo-G achieves a marked improvement in convergence speed, further underscoring its potential to enhance the scalability and flexibility of SFC deployment in dynamic, large-scale networks.</div></div>\",\"PeriodicalId\":50637,\"journal\":{\"name\":\"Computer Networks\",\"volume\":\"263 \",\"pages\":\"Article 111211\"},\"PeriodicalIF\":4.4000,\"publicationDate\":\"2025-03-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1389128625001793\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128625001793","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

移动设备的加速增长,以及5G、物联网和云计算等技术的进步,推动了对灵活多样的网络服务的需求不断增长。业务功能链(SFC)已经成为解决这些需求的关键技术,它利用软件定义网络(SDN)和网络功能虚拟化(NFV)的能力来实现动态业务部署。然而,跨动态和异构网络拓扑部署sfc仍然是一项艰巨的挑战,因为当前的解决方案通常受限于它们对特定网络结构的依赖。在本文中,我们提出了一种新的SFC部署框架Topo-G,该框架建立在协作多智能体强化学习(MARL)的基础上,旨在实现“一次训练,随处运行”范式下的拓扑泛化。不像现有的方法需要对新的网络拓扑进行再训练,Topo-G具有固有的适应性,无需再训练即可有效地泛化各种拓扑。该框架利用分散的部分可观察马尔可夫决策过程(Dec-POMDP)来解耦路由和放置任务,同时保持它们的相互依赖性。通过结合最短路径路由算法和VNF放置的候选池选择方法,Topo-G有效地协调决策过程,独立于底层网络拓扑。大量的实验表明,Topo-G在各种拓扑的部署效率和适应性方面都明显优于现有方法。此外,当需要再训练时,Topo-G在收敛速度上取得了显著的进步,进一步强调了其在动态大规模网络中增强SFC部署的可扩展性和灵活性的潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Achieving topology generalization without retraining in service function chaining through cooperative multi-agent reinforcement learning
The accelerating growth in mobile devices, along with advancements in technologies like 5G, IoT, and cloud computing, has driven a rising demand for flexible and diverse network services. Service Function Chaining (SFC) has emerged as a pivotal technique to address these demands, leveraging the capabilities of Software Defined Networking (SDN) and Network Function Virtualization (NFV) to enable dynamic service deployment. However, deploying SFCs across dynamic and heterogeneous network topologies remains a formidable challenge, as current solutions are often constrained by their reliance on specific network structures. In this paper, we propose Topo-G, a novel framework for SFC deployment, built upon Cooperative Multi-Agent Reinforcement Learning (MARL), designed to achieve topology generalization under a “train once, run anywhere” paradigm. Unlike existing methods that necessitate retraining for new network topologies, Topo-G is inherently adaptable, efficiently generalizing across diverse topologies without retraining. The framework leverages a decentralized partially observable Markov decision process (Dec-POMDP) to decouple the routing and placement tasks while preserving their interdependence. By incorporating a shortest-path routing algorithm and a candidate pool selection method for VNF placement, Topo-G efficiently coordinates the decision-making process, independent of the underlying network topology. Extensive experiments demonstrate that Topo-G significantly outperforms existing methods in both deployment efficiency and adaptability across various topologies. Additionally, when retraining is required, Topo-G achieves a marked improvement in convergence speed, further underscoring its potential to enhance the scalability and flexibility of SFC deployment in dynamic, large-scale networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
×
引用
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学术官方微信