Asymptotically Optimal Delay-aware Scheduling in Queueing Systems
Saad Kriouile, Mohamad Assaad, Maialen Larranaga

TL;DR
This paper develops a delay-aware scheduling policy for queueing systems with fewer channels than users, using Whittle index approach, proving asymptotic optimality and demonstrating strong numerical performance.
Contribution
It introduces a novel Whittle index-based scheduling policy for delay-sensitive queueing systems, proving its asymptotic optimality and structural properties.
Findings
Policy is optimal as number of users grows large.
Threshold policy achieves optimality in subproblems.
Numerical results show excellent performance.
Abstract
In this paper, we investigate a general delay-aware channel allocation problem where the number of channels is less than that of users. Due to the proliferation of delay sensitive applications, the objective of our problem is chosen to be the minimization of the total average backlog queues of the network in question. First, we show that our problem falls in the framework of Restless Bandit Problems (RBP), for which obtaining the optimal solution is known to be out of reach. To circumvent this difficulty, we tackle the problem by adopting a Whittle index approach. To that extent, we employ a Lagrangian relaxation of the original problem and prove it to be decomposable into multiple one-dimensional independent subproblems. Afterwards, we provide structural results on the optimal policy of each of the subproblems. More specifically, we prove that a threshold policy is able to achieve the…
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 Bandit Algorithms Research · Smart Grid Energy Management · Age of Information Optimization
