Researches In Virtualization Resource Allocation Algorithm In Wireless Data Center

In data centers,using wireless link instead of part of cable links can reduce amount of cost and the wiring complexity,so as to significantly optimize the performance of data center network.In addition,the application of virtualization technology has been widely applied in data centers.General and effective virtualization resource allocation algorithms not only provide efficient and reliable network resource sharing for systems and users,but also simplify the complexity of resource scheduling and management,improve utilization of substrate resource,balance network load and optimize network performance.As wireless network virtualization is a new field,with the development of wireless data center network,it is highly significant to study wireless data center network virtualization resource allocation algorithm.Therefore,based on wireless data center(WDC),this thesis designs a reasonable and effective virtualization resource allocation packing algorithm to solve low efficiency rate and high energy consumption cost of data centers and achieve energy conservation.In addition,Cayley data centers are the famous patterns of completely wireless data centers.But low link reliability and the link interference will affect the success rate of virtual network construction in wireless data centers.Accordingly,this paper designs a virtual resource allocation coloring algorithm based on link interference.Aiming at abundant energy optimization in 60 GHz wireless data centers,we investigate virtualization technology to assign virtual resources to minimum number of servers,and turn off other servers or adjust them to the state of low power.By comprehensive analysis of wireless data centers,we model virtual network and physical network in WDCs firstly,and propose Virtual Resource Mapping Packing Algorithm(VRMPA)to solve energy management problems.According to VRMPA,we adopt packing algorithm and sort physical resource only once,which improves efficiency of virtual resource allocation.Furthermore,this thesis proposes virtual resource mapping algorithm on the basis of Cayley structure.First,we model network in WDC,the virtual network is modeled as traditional undirected graph,while the physical topology is modeled as a directed graph.Second,we propose Virtual Resource Mapping Algorithm based on link interference(VRMCA-LI).For Cayley structure,the interference occurs only when the nodes are placed in the launch angle of directional antenna of transmitting nodes,so we build the connection interference matrix for each node and use color method to avoid the interference.Third,our experimental results show that VRMCA-LI outperforms WVNEA-LR and PG-VNE in terms of mapping time of the virtual nodes,the acceptance rate of virtual network and the average node utilization rate.