Network Slicing for URLLC

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 URLLC service provision due to its stringent requirements on low packet blocking probability and low codeword decoding error probability. This chapter proposes to orchestrate network resources for a slicing system to guarantee more reliable bursty URLLC transmission. This chapter re-cuts physical resource blocks and derives the minimum upper bound of bandwidth for URLLC transmission with a low packet blocking probability. This chapter also correlates coordinated multipoint beamforming with channel uses and derives 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, this chapter further investigates the network slicing for URLLC and eMBB service multiplexing. Particularly, it formulates 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, it develops a resource optimization algorithm based on a sample average approximate technique and a distributed optimization method with provable performance guarantees.