SFC Design and VNF Placement Based on Traffic Volume Scaling and VNF Dependency in 5G Networks

作     者：Zhihao Zeng Zixiang Xia Xiaoning Zhang Yexiao 

作者机构：He School of Information and Communication EngineeringUniversity of Electronic Science and Technology of ChinaChengdu611731China 

出 版 物：《Computer Modeling in Engineering & Sciences》 (工程与科学中的计算机建模（英文）)

年 卷 期：2023年第134卷第3期

页      面：1791-1814页

核心收录：

学科分类：0810[工学-信息与通信工程] 080904[工学-电磁场与微波技术] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 080402[工学-测试计量技术及仪器] 0804[工学-仪器科学与技术] 0835[工学-软件工程] 081001[工学-通信与信息系统] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported in part by the Open Research Projects of Zhejiang Lab(No.2021LC0AB04) in part by the National Natural Science Foundation of China(NSFC)(Nos.62171085,62001087,U20A20156,and 61871097) 

主　　题：Network function virtualization virtual network function service function chain resource allocation routing 

摘      要：The development of Fifth-Generation(5G)mobile communication technology has remarkably promoted the spread of the Internet of Things(IoT)*** a promising paradigm for IoT,edge computing can process the amount of data generated by mobile intelligent devices in less time *** Function Virtualization(NFV)that decouples network functions from dedicated hardware is an important architecture to implement edge computing,deploying heterogeneous Virtual Network Functions(VNF)(such as computer vision,natural language processing,intelligent control,etc.)on the edge service *** the NFV MANO(Management and Orchestration)framework,a Service Function Chain(SFC)that contains a set of ordered VNFs can be constructed and placed in the network to offer a customized network ***,the procedure of NFV orchestration faces a technical challenge in minimizing the network cost of VNF placement due to the complexity of the changing effect of traffic volume and the dependency on *** this end,we jointly optimize SFC design and VNF placement to minimize resource cost while taking account of VNF dependency and traffic volume ***,the problem is formulated as an Integer Linear Programming(ILP)model and proved NPhard by reduction from Hamiltonian Cycle *** we proposed an efficient heuristic algorithm called Traffic Aware and Interdependent VNF Placement(TAIVP)to solve the *** with the benchmark algorithms,emulation results show that our algorithm can reduce network cost by 10.2%and increase service request acceptance rate by 7.6%on average.