TY - GEN
T1 - A downlink resource scheduling strategy for URLLC traffic
AU - Pandey, Shashi Raj
AU - Alsenwi, Madyan
AU - Tun, Yan Kyaw
AU - Hong, Choong Seon
PY - 2019/2/27
Y1 - 2019/2/27
N2 - In this paper, we propose a dynamic resource scheduling of URLLC (Ultra-reliable low latency communication) and eMBB (Enhanced mobile broadband) services for the downlink in 5G networks. The eMBB traffic is characterized with the high bandwidth network services such as web browsing, video streaming, augmented realiy, and the URLLC services require sub-millisecond latency with low error rates (e.g., autonomous driving and remote surgery). Therefore, we aim to formalize a resource scheduling over a time-slot having multiplexed eMBB and URLLC traffic with the objective to protect eMBB users while maintaining URLLC stringent latency requirements. For this purpose, to guarantee minimum latency, we allow puncturing technique for URLLC traffic over the scheduled resources, and study the sequential scheduling scenario for the preempted eMBB users in the next time-slot. The simulations result show the efficacy of proposed dynamic scheduling method, and gain in priority based scheduling.
AB - In this paper, we propose a dynamic resource scheduling of URLLC (Ultra-reliable low latency communication) and eMBB (Enhanced mobile broadband) services for the downlink in 5G networks. The eMBB traffic is characterized with the high bandwidth network services such as web browsing, video streaming, augmented realiy, and the URLLC services require sub-millisecond latency with low error rates (e.g., autonomous driving and remote surgery). Therefore, we aim to formalize a resource scheduling over a time-slot having multiplexed eMBB and URLLC traffic with the objective to protect eMBB users while maintaining URLLC stringent latency requirements. For this purpose, to guarantee minimum latency, we allow puncturing technique for URLLC traffic over the scheduled resources, and study the sequential scheduling scenario for the preempted eMBB users in the next time-slot. The simulations result show the efficacy of proposed dynamic scheduling method, and gain in priority based scheduling.
UR - https://ieeexplore.ieee.org/abstract/document/8679266
U2 - 10.1109/BIGCOMP.2019.8679266
DO - 10.1109/BIGCOMP.2019.8679266
M3 - Article in proceeding
BT - In Proc. IEEE international conference on big data and smart computing (BigComp)
ER -