Research On Access Network Virtualization And Virtual Resource Management Algorithm

With the development of the Internet,the number of network users has increased rapidly,and the needs of users have become more and more abundant.A variety of new wireless access technologies have emerged in succession and aim to bring more and more rich business experiences for users.Network virtualization is to achieve the underlying network data forwarding function and control functions of the decoupling and separation,and based on the user to create a virtual network request to dynamically create a virtual network,its essence is: to reduce the number of base stations,sharing the underlying physical resources.The underlying physical resources are abstracted into virtual resources through virtualization technology.Then,the virtual resources are sliced horizontally,and the sliced resources are scheduled according to the specified resource scheduling algorithm.Used to host virtual requests.Therefore,how to efficiently manage and schedule virtual resources for carrying user requests is the focus of virtual resource management research.Firstly,it introduces the workflow and working principle of the existing virtual resource management architecture,and summarizes the characteristics of each architecture model.Existing virtual resource management architectures are: distributed management architecture,centralized management architecture,centralized management and distributed control architecture model.Then,the virtual resource management algorithm based on the small world model is studied by using the optical and wireless fusion network as the research object.The algorithm builds the small world model on the underlying physical network,and uses the virtualization technology to abstract the underlying resources into virtual resources for carrying the virtual request.In this paper,the path length between nodes,data transmission delay and node throughput are numerically simulated.The simulation results show that the virtual resource management algorithm based on the small world model reduces the path length between nodes and data transmission delay,and improves the node throughput.Finally,a multi-path mapping algorithm(SWPMP)based on small world model and user priority is proposed.The algorithm defines that the path used to host the virtual request is no longer a path,but that multiple paths share the virtual request,and the amount of data that needs to be transferred is allocated on each path according to the specified algorithm,so that the time taken to complete the data transfer is the maximum value of the delay on each path.The transmission delay is reduced,resulting in increased throughput at the node.At the same time,combined with the impact of user priority on resource management,the priority of the user request is given priority response,and the low priority hysteresis response ensures that the virtual requests of different service types are responded sequentially.In this paper,the data transmission delay and the node throughput in the mapping process are simulated numerically,and the influence of the user request priority on the performance of the algorithm is considered in the simulation.Compared with the virtual resource management algorithm based on the small world model,the multi-path(SWPMP)mapping algorithm based on the small world model and the user priority can further reduce the data transmission delay,effectively balance the network load,and improve the node throughput.