Opportunistic admission and resource allocation for slicing enhanced IoT networks

Abstract

Network slicing is envisioned as one of the key techniques to meet the extremely diversified service requirements of the Internet of Things (IoT) as it provides an enhanced user experience and elastic resource configuration. In the context of slicing enhanced IoT networks, both the Service Provider (SP) and Infrastructure Provider (InP) face challenges of ensuring efficient slice construction and high profit in dynamic environments. These challenges arise from randomly generated and departed slice requests from end-users, uncertain resource availability, and multi-dimensional resource allocation. Admission and resource allocation for distinct demands of slice requests are the key issues in addressing these challenges and should be handled effectively in dynamic environments. To this end, we propose an Opportunistic Admission and Resource allocation (OAR) policy to deal with the issues of random slicing requests, uncertain resource availability, and heterogeneous multi-resources. The key idea of OAR is to allow the SP to decide whether to accept slice requests immediately or defer them according to the load and price of resources. To cope with the random slice requests and uncertain resource availability, we formulated this issue as a Markov Decision Process (MDP) to obtain the optimal admission policy, with the aim of maximizing the system reward. Furthermore, the buyer-seller game theory approach was adopted to realize the optimal resource allocation, while motivating each SP and InP to maximize their rewards. Our numerical results show that the proposed OAR policy can make reasonable decisions effectively and steadily, and outperforms the baseline schemes in terms of the system reward.