Abstract

The deployment of parallel Service Function Chains (SFCs) in Network Function Virtualization (NFV) environments presents significant challenges in jointly optimizing Virtual Network Function (VNF) parallelization and placement decisions. Traditional approaches typically decouple these decisions, leading to suboptimal performance and inefficient resource utilization. This paper proposes HGNN-PSFC, a novel heterogeneous graph neural network-assisted multi-agent deep reinforcement learning framework that jointly optimizes VNF parallelization and placement for parallel SFC deployment. Our approach employs cooperative agents: a Parallelization Agent that determines optimal VNF parallelization structures, and multiple Placement Agents that make VNF placement decisions. The framework utilizes a heterogeneous graph representation to capture complex relationships between VNFs, substrate network topology, and current VNF placement states. Through Multi-Agent Proximal Policy Optimization (MAPPO) training within a Centralized Training with Decentralized Execution (CTDE) paradigm, our method achieves effective coordination between parallelization and placement decisions. Extensive experimental results demonstrate that HGNN-PSFC achieves near-optimal performance with approximately 92% of the optimal algorithm’s effectiveness while maintaining polynomial computational complexity.

Details

Title
A heterogeneous graph neural network assisted multi-agent reinforcement learning for parallel service function chain deployment
Author
Ai, Yintan 1 ; Li, Hua 1 ; Ruan, Hongwei 1 ; Liu, Hanlin 1 

 Inner Mongolia University, College of Computer Science, Hohhot, China (GRID:grid.411643.5) (ISNI:0000 0004 1761 0411) 
Pages
236
Publication year
2025
Publication date
Oct 2025
Publisher
Springer Nature B.V.
e-ISSN
13191578
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
3253955990
Copyright
© The Author(s) 2025. This work is published under http://creativecommons.org/licenses/by-nc-nd/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.