论文标题
在启用Comp-Nable的RAN中,多播umb和bursty urllc服务多路复用
Multicast eMBB and Bursty URLLC Service Multiplexing in a CoMP-Enabled RAN
论文作者
论文摘要
本文涉及切片无线电访问网络(RAN),以同时服务两个典型的5G及以后的用例,即增强的移动宽带(EMBB)和超可信和低延迟通信(URLLC)。尽管已经进行了许多研究来解决这个问题,但很少有人认为Bursty Urllc的影响。 URLLC流量的爆发特征可能会大大增加在确保超低数据包阻断概率的方面进行切片的难度。为了降低数据包阻断概率,我们根据我们的理论结果重新调查了在时间频面平面中为爆发的urllc流量而策划的物理资源块(PRB)的结构。同时,我们制定了切片的问题,即用于多播弹药和Bursty URLLC服务多路复用作为多时间尺度优化问题,启用了协调的多点(COMP)传输。此问题的目的是最大化多播和爆发的URLLC切片实用程序,但要受到物理资源约束。为了减轻这个棘手的多时间尺度问题,我们通过探索样本平均近似技术(SAA)技术的基本原理来将其转化为多个单个时间尺度问题。接下来,开发了具有可证明性能保证的迭代算法,以获取解决这些单个时间尺度问题的解决方案,并将所获得的解决方案汇总到多个频率问题的解决方案中。我们还设计了一个与多播刺激和爆发的URLLC流量相结合的Comp-NableS RAN切片系统的原型,并将所提出的迭代算法与最先进的算法进行比较,以验证算法的有效性。
This paper is concerned with slicing a radio access network (RAN) for simultaneously serving two typical 5G and beyond use cases, i.e., enhanced mobile broadband (eMBB) and ultra-reliable and low latency communications (URLLC). Although many researches have been conducted to tackle this issue, few of them have considered the impact of bursty URLLC. The bursty characteristic of URLLC traffic may significantly increase the difficulty of RAN slicing on the aspect of ensuring a ultra-low packet blocking probability. To reduce the packet blocking probability, we re-visit the structure of physical resource blocks (PRBs) orchestrated for bursty URLLC traffic in the time-frequency plane based on our theoretical results. Meanwhile, we formulate the problem of slicing a RAN enabling coordinated multi-point (CoMP) transmissions for multicast eMBB and bursty URLLC service multiplexing as a multi-timescale optimization problem. The goal of this problem is to maximize multicast eMBB and bursty URLLC slice utilities, subject to physical resource constraints. To mitigate this thorny multi-timescale problem, we transform it into multiple single timescale problems by exploring the fundamental principle of a sample average approximation (SAA) technique. Next, an iterative algorithm with provable performance guarantees is developed to obtain solutions to these single timescale problems and aggregate the obtained solutions into those of the multi-timescale problem. We also design a prototype for the CoMP-enabled RAN slicing system incorporating with multicast eMBB and bursty URLLC traffic and compare the proposed iterative algorithm with the state-of-the-art algorithm to verify the effectiveness of the algorithm.