Future wireless networks are convinced to provide flexible and cost-efficient services via exploiting network slicing techniques. However, it is challenging to configure network 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 error decoding probability. In this paper, we propose to orchestrate network resources for a network slicing system to guarantee a more reliable bursty URLLC service provision. We re-cut physical resource blocks (PRBs) and derive the minimum upper bound of bandwidth for URLLC transmission with a low packet blocking probability. We correlate coordinated multipoint (CoMP) beamforming with channel uses and derive the minimum upper bound of channel uses for URLLC transmission with a low codeword error decoding 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 to maximize the long-term total slice utility. The mitigation of this problem is challenging due to the requirements of future channel information and tackling a two timescale issue. To address the challenges, we develop a joint resource optimization algorithm based on a sample average approximate (SAA) technique and a distributed optimization method with provable performance guarantees.

中文翻译：

---

突发URLLC业务提供如何编排切片资源？

相信未来的无线网络将通过利用网络切片技术提供灵活且具有成本效益的服务。然而，由于其对低数据包阻塞概率和低码字错误解码概率的严格要求，为突发性超可靠和低延迟通信 (URLLC) 服务提供配置网络切片系统具有挑战性。在本文中，我们建议为网络切片系统编排网络资源，以保证更可靠的突发 URLLC 服务提供。我们重新切割物理资源块 (PRB) 并推导出具有低数据包阻塞概率的 URLLC 传输的最小带宽上限。我们将协调多点 (CoMP) 波束成形与信道使用相关联，并推导出具有低码字错误解码概率的 URLLC 传输的信道使用的最小上限。考虑到将各种服务融合到共享基础设施上的协议，我们进一步研究了 URLLC 的网络切片和增强型移动宽带 (eMBB) 服务复用。特别是，我们将服务复用制定为一个优化问题，以最大化长期总切片效用。由于未来频道信息的要求和解决两个时间尺度的问题，缓解这个问题具有挑战性。为了应对挑战，