Cost-Efficient and Latency-Sensitive SFC Multi-Path Parallel Deployment in NFV/SDN-Enabled Networks
Lirong Ma, Xin Li, Haijing Hou, Zhichuan Zuo, Hui Lin Zhou, Shanguo Huang · 2024
Addressing the stringent latency, bandwidth, and availability requirements of Service Function Chain (SFC) requests in dynamic network environments, this paper introduces a cost-efficient, latencysensitive SFC multi-path parallel deployment scheme.The scheme incorporates traffic splitting, with each sub-flow replicating a sub-SFC across various servers along multiple paths.We propose a CL-MPSFCD algorithm, which integrates Deep Q-Network (DQN) for adaptive determination of sub-flow numbers and server node grouping, and Particle Swarm Optimization (PSO) for routing path selection.The interaction between these layers optimizes deployment decisions.Experimental results confirm that CL-MPSFCD enhances node and link resource utilization and service acceptance rates, reduces end-to-end latency, and maintains a balance between performance improvement and computational cost. CCS Concepts• Networks → Middle boxes /