Research On Resource Pool Management Model And Scheduling Strategy Of Carrier Migration Under The Framework Of C-RAN

C-RAN,a new generation mobile communication network,is a wireless access network architecture based on centralized processing,cooperative radio and real-time cloud computing.The architecture focuses on the baseband processing resources to form a baseband resource pool and provides a unified management and dynamic allocation.The carrier migration technology under the framework of C-RAN is significant to deal with the tidal phenomena of telephone traffic effectively,improve the resource utilization and reduce the total energy consumption of the resource pool by the method of migrating the virtual base station load service.Because there are large-scale baseband processing resources in the resource pool,how to manage these resources and how to give reasonable carrier migration scheduling strategy on the basis of resource management model is still a problem to be solved urgently.Based on this,this paper studies the carrier migration technology under the framework of C-RAN from the following two aspects:(1)In order to manage the large-scale processing resources placed in the baseband pool,this paper studies the method of dividing the virtual base station in the resource pool into clusters.Due to the difference of virtual base station resource attributes,this paper studies the clustering scheme of dividing different types and same types of virtual base stations into one cluster.After analyzing the factors that should be considered in the clustering scheme,the corresponding mathematical model is established by combining the migration time and the energy consumption,and the clustering results under the two schemes are solved respectively.In this paper,the iterative process of the optimal algorithm of space-alternating generalized expectation-maximization algorithm is improved,and the iterative process is segmented by combining the characteristics of the clustering model.The method of reducing the repetition search is introduced by the taboo table,and the simulation results show that the improved algorithm can improve the quality of solutions.Finally,by comparing the two clustering schemes and the scheme of no clustering,we find that the scheme of carrier transport is divided into a cluster with different types of virtual base stations is optimal for the effect of carrier migration.(2)This paper studies the carrier migration scheduling strategy based on clustering,aiming at reducing the migration cost and the total power consumption of the resource pool.The mathematical model is established to meet the migration time and resource requirements to solve the carrier migration scheduling scheme,and the optimization algorithm of the model,the maximum and minimum ant system optimization algorithm is improved.Since the volatilization coefficient of pheromone in the original algorithm is a static value,and its size affects the global search ability and convergence rate of the algorithm,the pheromone volatilization coefficient is set as a value with the solution space and the number of iterations.Through the distribution simulation of the improved algorithm,the original algorithm and basic ant colony algorithm in solving problems of the different size of the solution space,comparing the three algorithms of the C index and M index,we conclude that the improved algorithm is better than the other two algorithms in searching better solutions.The simulation results show that the improved algorithm applied to the carrier migration scheduling strategy can achieve a relatively low resource pool total energy consumption at a lower migration cost.