Novel Slice Admission Control Scheme with Overbooking and Dynamic Buyback Process

In 5G and beyond systems, network slicing plays a key role as it enables infrastructure providers (InPs) to create logical networks (slices) and virtually share network resources to their tenants. However, due to the limited nature of network resources of the InP, resource management algorithms like resource allocation and admission control are required to ensure efficient management of the InP's scarce resources. Indeed, admission control algorithms play a critical role of regulating access to the network, by determining whether a slice request should be accepted or not with respect to some standards such as maximizing the InP's revenue and maintaining service level agreements (SLAs). In this paper, we propose an admission control algorithm that employs the concept of overbooking which allows the InP to admit slice requests beyond it's nominal available resources. Moreover, we employ a dynamic queue adaption priority, step-wise pooling and dynamic buyback price mechanism to ensure efficient and profitable admission decision for the InP. We assess the performance of the proposed algorithm against state of the art (SOTA) solution considering different priority schemes. The results show that the proposed solution outperforms the SOTA solution as it yields i) higher revenue, ii) lower buyback cost and iii) higher net revenue for the InP while still maintaining a marginally higher slice acceptance rate.