A Random Compensation Scheme for 5G Slicing Under Statistical Delay-QoS Constraints

Abstract

For the communication scenarios of heterogeneous arrivals in the fifth generation cellular networks, slicing is believed to be an effective way to provide quality-of-service (QoS) provisioning. However, the reports on an effective segmentation of resources for random and bursty arrival are rare. Relying on the bandwidth estimation and service design, we give a simple but effective scheme for the slicing of bandwidths named two-hole leaky bucket random service mechanism. The service in our scheme comprises two parts, the specific basic service and shared random compensation service. Accordingly, the mechanism of resource allocation is just like leaky bucket with two holes, one of which has a random leak rate. To guarantee the statistical QoS of heterogeneous traffic flows, effective bandwidth/capacity theory is introduced into the slicing scheme. By establishing function equations, we deduce the compensation probability of each slice, which is taken as the slicing adjustment factor. Simulation results prove that the random compensation scheme can satisfy the statistical QoS requirements of heterogeneous traffic flows. Although the scheme is proved to be effective against two slices, the proposed model is applicable to general multiple heterogeneous arrivals.

Keywords

• Quality of service
• network slicing
• resource allocation
• effective bandwidth
• effective capacity