Whittle index approach to size-aware scheduling for time-varying channels with multiple states
Research output: Contribution to journal › Article › Scientific › peer-review
We consider the optimal opportunistic scheduling problem for downlink data traffic in a wireless cell with time-varying channels. The scheduler itself operates at a very fast time scale of milliseconds, but the objective function is related to minimizing the holding costs at a much longer time scale, at the so-called flow level. The Whittle index approach is a powerful tool in this context, since it renders the flow-level optimization problem with heterogeneous users tractable. Until now, this approach has been applied to the opportunistic scheduling problem to generate non-anticipating index policies that may depend on the amount of attained service but do not utilize the exact size information. In this paper, we produce a size-aware (i.e., anticipating) index policy by applying the Whittle index approach in a novel way. By a numerical study based on simulations, we demonstrate that the resulting size-aware index policy systematically improves performance. As a side result, we show that the opportunistic scheduling problem is indexable when the file sizes follow the Pascal distribution, and we derive the corresponding Whittle index, which generalizes earlier results.
|Number of pages||31|
|Publication status||Published - Aug 2016|
|MoE publication type||A1 Journal article-refereed|
- Opportunistic scheduling, Size-based scheduling, Stochastic optimization, Whittle index