Asymptotically optimal delay-aware scheduling in wireless networks

07/01/2018
by   Saad Kriouile, et al.
0

In this paper, we investigate a channel allocation problem in networks taking into account the queues of users. Typically, there are less available channels than users, and at each slot the channels are allocated to users in such a way to minimize the total average queues in the network. We show that the problem falls in the framework of Restless Bandit Problems (RBP), for which obtaining the optimal solution is out of reach. This problem is analyzed in this paper using Whittle index approach. First, using the Lagrangian relaxation method, we provide a relaxed problem and show that it can be decomposed into simpler one-dimensional subproblems for which the optimal solution is a threshold-based policy. This allows us to characterize Whittle's indices for these one-dimensional systems and to develop an index-based heuristic policy for the original scheduling problem. We prove that this heuristic is asymptotically optimal in the infinitely many users regime and provide numerical results that illustrate its remarkably good performance.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

02/06/2019

Whittle Index Policy for Multichannel Scheduling in Queueing Systems

In this paper, we consider a queueing system with multiple channels (or ...
03/19/2018

Impulsive Control for G-AIMD Dynamics with Relaxed and Hard Constraints

Motivated by various applications from Internet congestion control to po...
08/27/2019

A Whittle Index Approach to Minimizing Functions of Age of Information

We consider a setting where multiple active sources send real-time updat...
01/09/2020

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 ...
02/04/2021

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...
11/05/2021

Mean-Field Approximation based Scheduling for Broadcast Channels with Massive Receivers

The emerging Industrial Internet of Things (IIoT) is driving an ever inc...
05/12/2020

Competitive Algorithms for Minimizing the Maximum Age-of-Information

In this short paper, we consider the problem of designing a near-optimal...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.