Whittle Index Policy for Multichannel Scheduling in Queueing Systems

by   Saad Kriouile, et al.

In this paper, we consider a queueing system with multiple channels (or servers) and multiple classes of users. We aim at allocating the available channels among the users in such a way to minimize the expected total average queue length of the system. This known scheduling problem falls in the framework of Restless Bandit Problems (RBP) for which an optimal solution is known to be out of reach for the general case. The contributions of this paper are as follows. We rely on the Lagrangian relaxation method to characterize the Whittle index values and to develop an index-based heuristic for the original scheduling problem. The main difficulty lies in the fact that, for some queue states, deriving the Whittle's index requires introducing a new approach which consists in introducing a new expected discounted cost function and deriving the Whittle's index values with respect to the discount parameter β. We then deduce the Whittle's indices for the original problem (i.e. with total average queue length minimization) by taking the limit β→ 1. The numerical results provided in this paper show that this policy performs very well and is very close to the optimal solution for high number of users.


page 1

page 2

page 3

page 4


Asymptotically optimal delay-aware scheduling in wireless networks

In this paper, we investigate a channel allocation problem in networks t...

Whittle Index Based Scheduling Policy for Minimizing the Cost of Age of Information

We design a new scheduling policy to minimize the general non-decreasing...

A Whittle Index Approach to Minimizing Functions of Age of Information

We consider a setting where multiple active sources send real-time updat...

On The Optimality of The Whittle's Index Policy For Minimizing The Age of Information

In this paper, we consider the average age minimization problem where a ...

On the Global Optimality of Whittle's index policy for minimizing the age of information

This paper examines the average age minimization problem where only a fr...

Learning Algorithms for Minimizing Queue Length Regret

We consider a system consisting of a single transmitter/receiver pair an...

Improved queue-size scaling for input-queued switches via graph factorization

This paper studies the scaling of the expected total queue size in an n×...

Please sign up or login with your details

Forgot password? Click here to reset