Ran Slice Selection Mechanism Based on Satisfaction Degree

Recently, with the development of Network Function Virtualization (NFV) and Software Defined Network (SDN), network slicing has been introduced as a key enabler to accommodate diversified services. But recent researches of RAN network slicing mainly focus on time-frequency resource allocation among slices. There is no direct study on related topic of RAN network slice and its selection. Therefore, this paper proposes an RAN slice selection mechanism based on transmission rate, delay and blocking rate. The optimization problem is proposed with the greatest Satisfaction Degree of the global network, and the problem is proved to be a 0-1 knapsack problem. The optimal solution is obtained by the dynamic programming algorithm. Finally, the simulation results show that the RAN slice selection mechanism proposed in this paper is better than reference mechanism.