skip to main content
Language:
Search Limited to: Search Limited to: Resource type Show Results with: Show Results with: Search type Index

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

Queueing systems, 2016-08, Vol.83 (3-4), p.195-225 [Peer Reviewed Journal]

Springer Science+Business Media New York 2016 ;ISSN: 0257-0130 ;EISSN: 1572-9443 ;DOI: 10.1007/s11134-016-9484-z

Full text available

Citations Cited by
  • Title:
    Whittle index approach to size-aware scheduling for time-varying channels with multiple states
  • Author: Aalto, Samuli ; Lassila, Pasi ; Osti, Prajwal
  • Subjects: Business and Management ; Channels ; Computer Communication Networks ; Control ; Mathematical models ; Operations Research/Decision Theory ; Optimization ; Performance indices ; Policies ; Probability Theory and Stochastic Processes ; Queueing theory ; Queuing ; Scheduling ; Studies ; Supply Chain Management ; Systems Theory ; Time
  • Is Part Of: Queueing systems, 2016-08, Vol.83 (3-4), p.195-225
  • Description: 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.
  • Publisher: New York: Springer US
  • Language: English
  • Identifier: ISSN: 0257-0130
    EISSN: 1572-9443
    DOI: 10.1007/s11134-016-9484-z
  • Source: ProQuest Central
Back to results list
INSPIRE LIBRARY - TON DUC THANG UNIVERSITY (84-028) 37 755 057 Feedback
19 Nguyen Huu Tho St. Dist.7, HCM thuvien@tdtu.edu.vn

Copyright © 2017 INSPIRE LIBRARY - TON DUC THANG UNIVERSITY

Searching Remote Databases, Please Wait