Service function chain mapping method based on delay guarantee


연구 분야: Networking



학회: Cluster Computing


초록

Network function virtualization achieves the softwareization of network functions through virtualization technology, reducing operational costs but introducing challenges in network orchestration complexity. To deploy service function chains efficiently and cost-effectively in a network function virtualization environment, a latency-guaranteed, optimized mapping method is proposed. Firstly, a model that minimizes the total network deployment cost for service function chains is established, comprehensively considering user latency requirements and network resource constraints. Secondly, a service function chain mapping method based on an improved sparrow search algorithm is introduced. Finally, the simulation results show that the bandwidth resource utilization of the ISSA-SFCM algorithm is improved by 3.8% and 8.5%, respectively, compared to the control DP-COA algorithm and First-Fit algorithm, with a higher service function chain request acceptance rate and lower average network cost.


Author Profile
Bin Zhuge

School of Information and Electronic Engineering (Sussex Artificial Intelligence Institute) Zhejiang Gongshang University Hangzhou 310018 China

Andorra
Author Profile
Xiaodan Cai

School of Information and Electronic Engineering (Sussex Artificial Intelligence Institute) Zhejiang Gongshang University Hangzhou 310018 China

Andorra
Author Profile
Zitian Zhang

School of Information and Electronic Engineering (Sussex Artificial Intelligence Institute) Zhejiang Gongshang University Hangzhou 310018 China

Andorra

📄 논문 정보

발행 연도 2025년
인용수 0
출판 국가 Andorra, China
사이트 Springer
좋아요 수 0

연관 논문 목록 (243건)