eMBB-URLLC Multiplexing: A Greedy Scheduling Strategy for URLLC Traffic with Multiple Delay Requirements

The coexistence of enhanced mobile broadband (eMBB) and ultra-reliable low-latency communication (URLLC) is common in 5G networks. 5G services require eMBB users to achieve higher data rate, and URLLC users to meet high reliability and low latency requirements. How to utilize limited resources to maximize the throughput of eMBB users in the system while meeting URLLC latency requirements is a very meaningful issue. In this paper, we delve into the latency composition of URLLC packets and subsequently derive an expression to determine the number of mini-slots that URLLC packets can be queued. We propose a greedy scheduling algorithm based on queuing theory, which solves the complex scheduling problem of URLLC packets with different latency requirements. At each mini-slot, we dynamically schedule the URLLC packets that arrive using the proposed algorithm. We demonstrate the significant advantages of our algorithm compared to other algorithms through extensive simulations. Specifically, our algorithm significantly reduces the throughput loss of eMBB users, and also meets the high reliability requirements of URLLC in the case of high URLLC load.