Joint Slice Level and Base Station Level Admission Control in RAN Slicing

The slicing admission control in fifth generation (5G) radio access networks (RAN) should be considering for the service level agreement (SLA) guarantees. In this paper, we present constraints on user transmission rate quality of service (QoS) for different kinds of slice SLAs in dynamic heterogeneous RAN scenario with differentially covered RAN slicing. We model the RAN slicing admission control problem as two parts: slice-level admission control and base station (BS)-level admission control. Then, we design a user-and-slice based service request queue and propose an optimal admission control problem for RAN slicing. The problem is divided into two sub-problems. We solve the slice-level admission control sub-problem and the BS-level admission control sub-problem within each frame by using Lyapunov's optimization theory and greedy strategy respectively, and finally obtain the approximate optimal solution. The simulation results show that the proposed algorithm can obtain the best time average profit and the best admission control decision compared with the benchmark algorithms.