research-article

Whittle Index Approach to Size-aware Scheduling with Time-varying Channels

Authors:

Prajwal OstiAuthors Info & Claims

SIGMETRICS '15: Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems

Pages 57 - 69

https://doi.org/10.1145/2745844.2745851

Published: 15 June 2015 Publication History

Abstract

We consider the optimal opportunistic scheduling problem for downlink data traffic in a wireless cell with time-varying channels. The scheduler itself operates in a very fast timescale of milliseconds, but the objective function is related to minimizing the holding costs in a much longer timescale, 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.

References

[1]

S. Aalto and P. Lassila. Flow-level stability and performance of channel-aware priority-based schedulers. In Proc. of NGI, 2010.

[2]

S. Aalto, A. Penttinen, P. Lassila, and P. Osti. On the optimal trade-off between SRPT and opportunistic scheduling. In Proc. of ACM Sigmetrics, pages 185--195, June 2011.

Digital Library

[3]

S. Aalto, A. Penttinen, P. Lassila, and P. Osti. Optimal size-based opportunistic scheduler for wireless systems. Queueing Systems, 72:5--30, 2012.

Digital Library

[4]

U. Ayesta, M. Erasquin, and P. Jacko. A modeling framework for optimizing the flow-level scheduling with time-varying channels. Performance Evaluation, 67:1014--1029, 2010.

Digital Library

[5]

U. Ayesta, M. Erausquin, M. Jonckheere, and I. Verloop. Scheduling in a random environment: stability and asymptotic optimality. IEEE/ACM Transactions on Networking, 21:258--271, 2013.

Digital Library

[6]

P. Bender, P. Black, M. Grob, R. Padovani, N. Sindhushyana, and S. Viterbi. CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users. IEEE Communications Magazine, 38(7):70--77, 2000.

Digital Library

[7]

T. Bonald, S. Borst, N. Hegde, M. Jonckheere, and A. Proutiére. Flow-level performance and capacity of wireless networks with user mobility. Queueing Systems, 63:131--164, 2009.

Digital Library

[8]

S. Borst. User-level performance of channel-aware scheduling algorithms in wireless data networks. IEEE/ACM Transactions on Networking, 13:636--647, 2005.

Digital Library

[9]

S. Borst and M. Jonckheere. Flow-level stability of channel-aware scheduling algorithms. In Proc. of WiOpt, April 2006.

[10]

F. Cecchi and P. Jacko. Scheduling of users with Markovian time-varying transmission rates. In Proc. of ACM Sigmetrics, pages 129--140, June 2013.

Digital Library

[11]

J. Gittins, K. Glazebrook, and R. Weber. Multi-armed Bandit Allocation Indices. Wiley, second edition, 2011.

[12]

P. Jacko. Value of information in optimal flow-level scheduling of users with Markovian time-varying channels. Performance Evaluation, 68:1022--1036, 2011.

Digital Library

[13]

A. Jalali, R. Padovani, and R. Pankaj. Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system. In Proc. of IEEE VTC 2000 Spring, pages 1854--1858, May 2000.

[14]

J. Kim, B. Kim, J. Kim, and Y. Bae. Stability of flow-level scheduling with Markovian time-varying channels. Performance Evaluation, 70:148--159, 2013.

Digital Library

[15]

R. Knopp and P. Humblet. Information capacity and power control in single-cell multiuser communications. In Proc. of IEEE ICC, pages 331--335, June 1995.

[16]

S. Ross. Applied Probability Models with Optimization Applications. Holden-Day, 1970.

[17]

B. Sadiq and G. de Veciana. Balancing SRPT prioritization vs opportunistic gain in wireless systems with flow dynamics. In Proc. of ITC-22, September 2010.

[18]

L. Schrage. A proof of the optimality of the shortest remaining processing time discipline. Operations Research, 16:687--690, 1968.

Digital Library

[19]

I. Taboada, P. Jacko, U. Ayesta, and F. Liberal. Opportunistic scheduling of flows with general size distribution in wireless time-varying channels. In Proc. of ITC-26, September 2014.

[20]

I. Taboada, F. Liberal, and P. Jacko. An opportunistic and non-anticipating size-aware scheduling proposal for mean holding cost minimization in time-varying channels. Performance Evaluation, 79:90--103, 2014.

[21]

L. Tassiulas and A. Ephremides. Dynamic server allocation to parallel queues with randomly varying connectivity. IEEE Transactions on Information Theory, 39:466--478, 1993.

Digital Library

[22]

P. van de Ven, S. Borst, and S. Shneer. Instability of MaxWeight scheduling algorithms. In Proc. of IEEE Infocom, pages 1701--1709, April 2009.

[23]

P. Whittle. Restless bandits: activity allocation in a changing world. Journal of Applied Probability, 25A:287--298, 1988.

Cited By

Zamir NHou IPapavassiliou SSchmid S(2024)Deep Index Policy for Multi-Resource Restless Matching Bandit and Its Application in Multi-Channel SchedulingProceedings of the Twenty-fifth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing10.1145/3641512.3686381(71-80)Online publication date: 14-Oct-2024
https://dl.acm.org/doi/10.1145/3641512.3686381
Pavamana KSingh C(2024)Caching Contents with Varying Popularity Using Restless BanditsPerformance Evaluation Methodologies and Tools10.1007/978-3-031-48885-6_9(133-150)Online publication date: 3-Jan-2024
https://doi.org/10.1007/978-3-031-48885-6_9
Gast NGaujal BYan C(2023)Exponential asymptotic optimality of Whittle index policyQueueing Systems10.1007/s11134-023-09875-x104:1-2(107-150)Online publication date: 21-May-2023
https://doi.org/10.1007/s11134-023-09875-x
Show More Cited By

Index Terms

Whittle Index Approach to Size-aware Scheduling with Time-varying Channels
1. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Scheduling algorithms
    2. Online algorithms
      1. Online learning algorithms
        Scheduling algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning
        Sequential decision making

Recommendations

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

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 ...
Whittle Index Approach to Size-aware Scheduling with Time-varying Channels
Performance evaluation review

We consider the optimal opportunistic scheduling problem for downlink data traffic in a wireless cell with time-varying channels. The scheduler itself operates in a very fast timescale of milliseconds, but the objective function is related to minimizing ...
Whittle index approach to multiserver scheduling with impatient customers and DHR service times
Abstract
We consider the optimal scheduling problem in a multiserver queue with impatient customers belonging to multiple classes. We assume that each customer has a random abandonment time, after which the customer leaves the system if its service has not ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMETRICS '15: Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems

June 2015

488 pages

ISBN:9781450334860

DOI:10.1145/2745844

General Chairs:
Bill Lin
University of California, San Diego
,
Jun (Jim) Xu
Georgia Tech
,
Program Chairs:
Sudipta Sengupta
Microsoft Research
,
Devavrat Shah
Massachusetts Institute of Technology

ACM SIGMETRICS Performance Evaluation Review Volume 43, Issue 1
Performance evaluation review
June 2015
468 pages
ISSN:0163-5999
DOI:10.1145/2796314
Editors:
Derek Eager
University of Saskatchewan
,
Carey Williamson
University of Calgary
Issue’s Table of Contents

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 June 2015

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Academy of Finland

Conference

SIGMETRICS '15

Sponsor:

SIGMETRICS

SIGMETRICS '15: ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems

June 15 - 19, 2015

Oregon, Portland, USA

Acceptance Rates

SIGMETRICS '15 Paper Acceptance Rate 32 of 239 submissions, 13%;

Overall Acceptance Rate 459 of 2,691 submissions, 17%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
279
Total Downloads

Downloads (Last 12 months)16
Downloads (Last 6 weeks)1

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zamir NHou IPapavassiliou SSchmid S(2024)Deep Index Policy for Multi-Resource Restless Matching Bandit and Its Application in Multi-Channel SchedulingProceedings of the Twenty-fifth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing10.1145/3641512.3686381(71-80)Online publication date: 14-Oct-2024
https://dl.acm.org/doi/10.1145/3641512.3686381
Pavamana KSingh C(2024)Caching Contents with Varying Popularity Using Restless BanditsPerformance Evaluation Methodologies and Tools10.1007/978-3-031-48885-6_9(133-150)Online publication date: 3-Jan-2024
https://doi.org/10.1007/978-3-031-48885-6_9
Gast NGaujal BYan C(2023)Exponential asymptotic optimality of Whittle index policyQueueing Systems10.1007/s11134-023-09875-x104:1-2(107-150)Online publication date: 21-May-2023
https://doi.org/10.1007/s11134-023-09875-x
Xiong GWang SLi JKoyejo SMohamed SAgarwal ABelgrave DCho KOh A(2022)Learning infinite-horizon average-reward restless multi-action bandits via index awarenessProceedings of the 36th International Conference on Neural Information Processing Systems10.5555/3600270.3601572(17911-17925)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.5555/3600270.3601572
Duran SAyesta UVerloop I(2022)On the Whittle index of Markov modulated restless banditsQueueing Systems10.1007/s11134-022-09737-y102:3-4(373-430)Online publication date: 27-Jun-2022
https://doi.org/10.1007/s11134-022-09737-y
Wang KChen LWang KChen L(2021)Whittle Index Policy for Opportunistic Scheduling: Heterogeneous Multistate ChannelsRestless Multi-Armed Bandit in Opportunistic Scheduling10.1007/978-3-030-69959-8_5(109-141)Online publication date: 20-May-2021
https://doi.org/10.1007/978-3-030-69959-8_5
Wang KChen LWang KChen L(2021)Whittle Index Policy for Opportunistic Scheduling: Heterogeneous Two-State ChannelsRestless Multi-Armed Bandit in Opportunistic Scheduling10.1007/978-3-030-69959-8_3(37-77)Online publication date: 20-May-2021
https://doi.org/10.1007/978-3-030-69959-8_3
Nguyen TAyesta UPrabhu B(2019)Scheduling users in drive-thru Internet: a multi-armed bandit approach2019 International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT)10.23919/WiOPT47501.2019.9144139(1-8)Online publication date: Jun-2019
https://doi.org/10.23919/WiOPT47501.2019.9144139
Aalto SLassila PTaboada I(2019)Indexability of an opportunistic scheduling problem with partial channel informationProceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools10.1145/3306309.3306324(95-102)Online publication date: 12-Mar-2019
https://dl.acm.org/doi/10.1145/3306309.3306324
Anand Ade Veciana G(2018)A Whittle's Index Based Approach for QoE Optimization in Wireless NetworksProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/31794182:1(1-39)Online publication date: 3-Apr-2018
https://dl.acm.org/doi/10.1145/3179418
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents