Virtual Resource Allocation Algorithm Based On Network Slicing

With the communications evolved,5G will be an end-to-end ecosystem which will create a fully mobile and connected society.The emergence of 5G will meet the diversified business needs of people.However,different services have great differences in demand for speed,delay,reliability,and connection number density.In order to ensure the quality of users' services,network slicing technology Become one of the key technologies of the future 5G.The virtual resource allocation based on network slicing not only satisfies the different service requirements of each slice,ensures the flexibility of each slice,but also ensures the independence between slices.The efficient resource allocation algorithm can improve resource utilization,system capacity,user service quality,Network income and so on.This paper focuses on virtual resource allocation algorithm based on network slicing.The main contents and innovations of the paper are summarized as follows:In order to solve the problem of resource allocation between 5G virtual network slicing,proposes a resource scheduling mechanism based on Online Double Auction(ODA)is proposed.Firstly,the priority of network slicing and unit resource quotes are determined according to different traffic needs and traffic benefits.Then,to maximize the network revenue,an offline single auction model is established.Further,based on the resources dynamic allocation and recycling,the price-updating algorithm is proposed to update the resource price in real time.Finally,the offline single auction mechanism and the price update mechanism are combined to establish ODA model and allocate resources dynamically for the network slicing.The simulation results show that the proposed mechanism can improve network revenue and guarantee the QoS requirement of each slice users.we proposed an adaptive virtual resource allocation algorithm based on Constrained Markov Decision Process(CMDP)for wireless access network slicing virtual resource allocation.First of all,this algorithm in the NOMA system,uses the user outage probability and the slice queues as constraints,uses the total rate of slices as a reward to build a resource adaptive problem using the CMDP theory.Secondly,the post-decision state is defined to avoid the expectation operation in the optimal value function.Furthermore,aiming at the problem of "dimensionality disaster" of MDP,based on the approximate dynamic programming theory,Space and reduce the computational dimension.Finally,designes an adaptive virtual resource allocation algorithm to optimize the slicing performance.The simulation results show that the algorithm can improve the performance of the system and meet the service requirements of slicing.