5G New Radio (NR) is envisioned to efficiently support both enhanced mobile broadband (eMBB) and ultra-reliable low-latency communication (URLLC). Due to the severe constraint of URLLC traffic, the time resources used by eMBB are further divided into mini-slots. From the media access control (MAC) layer scheduling perspective, the resource allocation occurs on different timescales, and URLLC traffic is pre-emptively overlapped at the mini-slot timescale to obtain the strict requirements of URLLC (achieve 99.999% reliability within 1 ms latency). In this article, we analyze the multiplexing of eMBB and URLLC traffic in 5G downlink transmission, with the dual objectives of maximizing eMBB utility like proportional fairness for eMBB users while satisfying URLLC constraints. We formulate the resource allocation problem in each mini-slot as the integer programming (IP) problem with two solutions: 1) convex relaxation; 2) greedy algorithm. The simulation results show that our algorithms have a higher utility of eMBB users while satisfying the URLLC users’ latency and reliability requirements than using basic round robin. The performance comparison between the two algorithms is extensively studied, and the choice of two algorithms in practice can be decided by the trade-off analysis investigated in this article.

中文翻译：

---

5G NR中的eMBB服务内的URLLC流量复用：公平调度

预计5G新无线电（NR）可有效支持增强型移动宽带（eMBB）和超可靠的低延迟通信（URLLC）。由于URLLC流量的严格限制，eMBB使用的时间资源进一步划分为小时隙。从媒体访问控制（MAC）层调度的角度来看，资源分配发生在不同的时间尺度上，并且URLLC流量在小时隙时间尺度上被抢占地重叠，以获得URLLC的严格要求（在1 ms的延迟内达到99.999％的可靠性） ）。在本文中，我们分析了5G下行链路传输中eMBB和URLLC流量的复用，其双重目标是在满足URLLC约束的同时最大化eMBB实用程序（如eMBB用户的比例公平）。我们将每个小时隙中的资源分配问题表述为具有两个解决方案的整数规划（IP）问题：1）凸松弛；2）贪婪算法。仿真结果表明，与基本轮循机制相比，我们的算法在满足MBLC用户的时延和可靠性要求的同时，具有更高的eMBB用户效用。广泛研究了两种算法之间的性能比较，并且可以通过本文研究的权衡分析确定两种算法在实践中的选择。