Timely-Throughput Optimal Scheduling with Prediction
Kun Chen, Longbo Huang

TL;DR
This paper investigates how predictive scheduling can enhance timely-throughput in stochastic multi-user systems, deriving optimal policies and quantifying improvements based on prediction accuracy and system parameters.
Contribution
It introduces a Markov decision process framework for predictive scheduling, explicitly characterizes optimal policies, and quantifies throughput gains considering prediction errors and system parameters.
Findings
Predictive scheduling significantly improves timely-throughput.
Optimal policies depend on prediction accuracy and system parameters.
Simulation results validate theoretical throughput improvements.
Abstract
Motivated by the increasing importance of providing delay-guaranteed services in general computing and communication systems, and the recent wide adoption of learning and prediction in network control, in this work, we consider a general stochastic single-server multi-user system and investigate the fundamental benefit of predictive scheduling in improving timely-throughput, being the rate of packets that are delivered to destinations before their deadlines. By adopting an error rate-based prediction model, we first derive a Markov decision process (MDP) solution to optimize the timely-throughput objective subject to an average resource consumption constraint. Based on a packet-level decomposition of the MDP, we explicitly characterize the optimal scheduling policy and rigorously quantify the timely-throughput improvement due to predictive-service, which scales as…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Wireless Network Optimization · Age of Information Optimization · Advanced MIMO Systems Optimization
