Research On Service Function Chain Mapping In Network Function Virtualization

In recent years,with the rapid development of mobile Internet and the rapid growth of the network traffic,it has brought great challenges to operators.In order to meet the growing demand for network services,operators need to constantly update and expand the network capacity.However,in traditional networks,dedicated hardware devices with high cost,difficult migration and inflexible deployment are still widely used.In recent years,cloud computing and software-defined network(SDN)technology have developed rapidly,and the network function virtualization(NFV)technology developed along with it has well solved these problems existing in the traditional network.The idea of decoupling hardware and software ensures the flexibility of the network and greatly reduces the cost of network expansion,migration and deployment.In the research of NFV technology,the reasonable deployment of the required service functions in the virtual network to the physical network is the basis of the research,and the reasonable resource allocation strategy determines the overall performance of the network.As we all know,the overall performance and service quality of the network are related to many indicators,among which the delay is one of the most obvious indicators that can affect the user experience.Therefore,this paper studies the mapping problem of service function chain under different delay requirements and different scenarios in NFV network:Firstly,this paper establishes a model of integer linear programming by analyzing the mapping problem of single service function chain under the dynamic scenario,and proposes an effective node selection algorithm to help improve the efficiency of the algorithm,and a new heuristic algorithm for the mapping of low delay,aiming at the optimization goal of low delay.Then through the simulation data analysis of the service function chain mapping under the dynamic scene,it is verified that the proposed heuristic algorithm can better solve the problem of low delay mapping than the existing algorithm.Secondly,this paper studies the low delay mapping problem of service function graph.This paper analyzes the shortcomings of the existing research on service function graph,and establishes the corresponding integer linear programming model,and proposes the Service Function Graph Mapping algorithm to solve hese problems.Then through simulation and analysis,it is proved that the proposed heuristic algorithm can correctly solve the mapping problem of service function graph,and has better performance than the existing heuristic algorithm in terms of delay performance.Finally,this paper introduces a uniform mapping algorithm for multi-service function chain.This paper analyzes the shortcomings of the existing studies on multi-sfc unified mapping.In view of these problems,this paper constructs the corresponding integer linear programming model and proposes the Unified mapping of multiple service function chains(UMMSFC)algorithm.Finally,through simulation and analysis,it is verified that the proposed UMMSFC algorithm can correctly solve the problem of unified mapping of multiple service function chains,and has better performance than existing studies in saving mapping cost.