Yintan Ai, Hua Li, Hongwei Ruan, Hanlin Liu, Xianrong Wang
{"title":"通过协作式多智能体强化学习实现业务功能链拓扑泛化无需再训练","authors":"Yintan Ai, Hua Li, Hongwei Ruan, Hanlin Liu, 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, Hua Li, Hongwei Ruan, Hanlin Liu, 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}
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 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.