Home > Research > Publications & Outputs > Scheduling of users with markovian time-varying...

Electronic data

  • wireless_Markovian3_2_abridged_pdf

    Rights statement: © ACM, 2013.This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in SIGMETRICS '13 Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems http://doi.acm.org/10.1145/2465529.2465550

    Accepted author manuscript, 6.35 MB, PDF document

Links

Text available via DOI:

View graph of relations

Scheduling of users with markovian time-varying transmission rates

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published
Publication date2013
Host publicationSIGMETRICS '13 Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Place of PublicationNew York
PublisherACM
Pages129-140
Number of pages12
ISBN (print)9781450319003
<mark>Original language</mark>English
Eventthe ACM SIGMETRICS/international conference - Pittsburgh, PA, USA, United Kingdom
Duration: 17/06/201321/06/2013

Conference

Conferencethe ACM SIGMETRICS/international conference
Country/TerritoryUnited Kingdom
Period17/06/1321/06/13

Conference

Conferencethe ACM SIGMETRICS/international conference
Country/TerritoryUnited Kingdom
Period17/06/1321/06/13

Abstract

We address the problem of developing a well-performing and implementable scheduler of users with wireless connection to the base station. The main feature of such real-life systems is that the quality conditions of the user channels are time-varying, which turn into the time-varying transmission rate due to different modulation and coding schemes. We assume that this phenomenon follows a Markovian law and most of the discussion is dedicated to the case of three quality conditions of each user, for which we characterize an optimal index policy and show that threshold policies (of giving higher priority to users with higher transmission rate) are not necessarily optimal. For the general case of arbitrary number of quality conditions we design a scheduler and propose its two practical approximations, and illustrate the performance of the proposed index-based schedulers and existing alternatives in a variety of simulation scenarios.

Bibliographic note

© ACM, 2013.This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in SIGMETRICS '13 Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems http://doi.acm.org/10.1145/2465529.2465550