How Should I Orchestrate Resources of My Slices for Bursty URLLC Service Provision?
Peng Yang, Xing Xi, Tony Q. S. Quek, Jingxuan Chen, Xianbin Cao, Dapeng Wu
Abstract
Future wireless networks are convinced to provide flexible and cost-efficient services via exploiting network slicing techniques. However, it is challenging to configure slicing systems for bursty ultra-reliable and low latency communications (URLLC) service provision due to its stringent requirements on low packet blocking probability and low codeword decoding error probability. In this paper, we propose to orchestrate network resources for a slicing system to guarantee more reliable bursty URLLC transmission. We re-cut physical resource blocks and derive the minimum upper bound of bandwidth for URLLC transmission with a low packet blocking probability. We correlate coordinated multipoint beamforming with channel uses and derive the minimum upper bound of channel uses for URLLC transmission with a low codeword decoding error probability. Considering the agreement on converging diverse services onto shared infrastructures, we further investigate the network slicing for URLLC and enhanced mobile broadband (eMBB) service multiplexing. Particularly, we formulate the service multiplexing as an optimization problem, which is challenging to be mitigated due to requirements of future channel information and of tackling a two timescale issue. To address the challenges, we develop a resource optimization algorithm based on a sample average approximate technique and a distributed optimization method with provable performance guarantees.