Research On The Application Of Virtual Radio Resources In Heterogeneous Networks

In recent years,the scale of the Internet continues to expand in emerging applications,followed by the Internet in the aspects of architecture,mobility,scalability and security problems.As a key means to ease or even solve the rigidity of the Internet architecture,network virtualization technology has attracted the attention of future network researchers.It is an important technology in the virtual network that how to realize the virtual network mapping to the heterogeneous network.At present,the wireless network virtualization is still a relatively new field,therefore,the research on the resource allocation algorithm in the wireless heterogeneous network virtualization has important theoretical and practical significance.In this paper,we introduce the constraints of resource allocation,the goal of resource optimization and the existing virtual mapping algorithm.On this basis,a heuristic mapping algorithm based on the shortest path is proposed.Firstly,a set of candidate mapping physical nodes is determined for each virtual node.After the completion of the identified candidate mapping physical nodes,the number of candidate physical nodes performs the sort algorithm,according to the sorting number of candidate physical nodes from less to more,virtual nodes' mapping complete.During the choice of the path,the path cost can be got through the Dijkstra shortest path algorithm,then physical nodes' mapping potential can be calculated according to the formula.The number of physical nodes is small,the higher the priority mapping.The algorithm has two sorting process,a number of candidate physical nodes on the virtual node corresponding to decide which sort of a virtual node priority mapping;another is the physical node potential sorting,determine which physical node priority mapping.The algorithm achieves a more balanced usage of physical resources,thereby reducing the network blocking rate and improving resource utilization.In this paper,a resource allocation strategy based on resource compensation for adaptive heterogeneous wireless virtual networks is studied.If there are K users on the demanding of virtual base station,making a set of constraints on the parameters and distribution of date rate to users in the selection of the network,and through the constraint relaxation method to simplify the constraint group,a group of linear programming constraints can be got.Adaptive allocation refers to the allocation of resources according to the supply and demand of resources.The compensation mechanism of resource redistribution process is mainly two processes: the first is to compensate the resources available in the same base station;if the wireless resources with a same base station in shortage,call the base station position near the other base compensation.This algorithm improves the satisfaction level of virtual network operators,and maximizes the effective utilization rate under the condition of limited capacity.