Guaranteed Dynamic Scheduling of Ultra-Reliable Low-Latency Traffic via Conformal Prediction
This addresses the problem of efficient resource allocation for URLLC in wireless networks, offering a solution with formal guarantees, though it appears incremental as it builds on existing conformal prediction methods.
The paper tackles the challenge of dynamic scheduling for ultra-reliable low-latency traffic (URLLC) in uplink networks by introducing a novel scheduler that provides formal guarantees on reliability and latency, regardless of predictor quality, using online conformal prediction to adjust resource allocation.
The dynamic scheduling of ultra-reliable and low-latency traffic (URLLC) in the uplink can significantly enhance the efficiency of coexisting services, such as enhanced mobile broadband (eMBB) devices, by only allocating resources when necessary. The main challenge is posed by the uncertainty in the process of URLLC packet generation, which mandates the use of predictors for URLLC traffic in the coming frames. In practice, such prediction may overestimate or underestimate the amount of URLLC data to be generated, yielding either an excessive or an insufficient amount of resources to be pre-emptively allocated for URLLC packets. In this paper, we introduce a novel scheduler for URLLC packets that provides formal guarantees on reliability and latency irrespective of the quality of the URLLC traffic predictor. The proposed method leverages recent advances in online conformal prediction (CP), and follows the principle of dynamically adjusting the amount of allocated resources so as to meet reliability and latency requirements set by the designer.