Whittle index approach to size-aware scheduling for time-varying channels with multiple states

Tutkimustuotos: Lehtiartikkelivertaisarvioitu

Standard

Whittle index approach to size-aware scheduling for time-varying channels with multiple states. / Aalto, Samuli; Lassila, Pasi; Osti, Prajwal.

julkaisussa: QUEUEING SYSTEMS, Vuosikerta 83, Nro 3, 08.2016, s. 195–225.

Tutkimustuotos: Lehtiartikkelivertaisarvioitu

Harvard

APA

Vancouver

Author

Bibtex - Lataa

@article{e1582b819712461dbbfbd23da1cb9d59,
title = "Whittle index approach to size-aware scheduling for time-varying channels with multiple states",
abstract = "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.",
keywords = "Opportunistic scheduling, Size-based scheduling, Stochastic optimization, Whittle index",
author = "Samuli Aalto and Pasi Lassila and Prajwal Osti",
year = "2016",
month = "8",
doi = "10.1007/s11134-016-9484-z",
language = "English",
volume = "83",
pages = "195–225",
journal = "QUEUEING SYSTEMS",
issn = "0257-0130",
publisher = "Springer Netherlands",
number = "3",

}

RIS - Lataa

TY - JOUR

T1 - Whittle index approach to size-aware scheduling for time-varying channels with multiple states

AU - Aalto, Samuli

AU - Lassila, Pasi

AU - Osti, Prajwal

PY - 2016/8

Y1 - 2016/8

N2 - 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.

AB - 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.

KW - Opportunistic scheduling

KW - Size-based scheduling

KW - Stochastic optimization

KW - Whittle index

UR - http://www.scopus.com/inward/record.url?scp=84974831080&partnerID=8YFLogxK

U2 - 10.1007/s11134-016-9484-z

DO - 10.1007/s11134-016-9484-z

M3 - Article

AN - SCOPUS:84974831080

VL - 83

SP - 195

EP - 225

JO - QUEUEING SYSTEMS

JF - QUEUEING SYSTEMS

SN - 0257-0130

IS - 3

ER -

ID: 6471375