Research On Resource Allocation Algorithm In Wireless Network Virtualization

The emergence of new networks is to adapt to the rapid growth of user traffic and service types,but the emerging networks need a strong network management mechanism to adapt to the flexibility of the network.Wireless network virtualization technology solves the technical difficulties in convergence,which also shows the importance of extending virtualization technology to wireless networks.Aiming at the problem of how to rationalize the allocation of virtual resources in wireless environment,this thesis proposes two efficient resource allocation solutions for wireless network virtualization.The main work and innovations are as follows:Firstly,the dynamic nature of wireless networks can easily fragment the underlying physical resources in the process of virtual network mapping,thus affecting the mapping acceptance rate of subsequent requests.In order to remedy the shortcomings of the above algorithms,this paper proposes a Packet Mapping of Adjacent Nodes in Wireless Network Virtualization(P-AN)method to solve the resource allocation problem of mapping in wireless virtual network.The algorithm considers the topological properties of the network in the mapping process,and defines a new sorting method for node classification and a selection scheme for candidate nodes.The simulation results show that P-AN algorithm improves the acceptance rate of wireless virtual network mapping,and has good effects in the aspects of virtual network revenue,virtual network overhead,physical resource utilization and so on.Then,the user requests can arrive or leave at any time in the dynamic resource environment,and the dynamic and uncertain nature of the network may lead to the imbalance of resources in the shared physical network,which may lead to the waste of resources and energy,and have a certain impact on future network requests.In order to solve the problem of unbalanced load of resources and waste of energy,a reconfiguration dormancy algorithm(HR-NRM)for Node Repeatable Mapping is proposed in this thesis.This algorithm makes use of the characteristics of node repeatable mapping and sets threshold so that the network can adjust the node and link resources of wireless network adaptively.The simulation results show that the HR-NRM algorithm combines the characteristics of repeatable mapping of nodes and adaptively adjusts the resources of nodes and links in the wireless network under the dynamic virtual network environment,so as to achieve a balanced state of resources.At the same time,it improves the utilization rate of resources on the basis of reducing energy consumption.