Delay-optimal opportunistic scheduling and approximations: The log rule

Bilal Sadiq, Seung Jun Baek, Gustavo De Veciana

Research output: Contribution to journalArticle

62 Citations (Scopus)

Abstract

This paper considers the design of multiuser opportunistic packet schedulers for users sharing a time-varying wireless channel from performance and robustness points of view. For a simplified model falling in the classical Markov decision process framework, we numerically compute and characterize mean-delay-optimal scheduling policies. The computed policies exhibit radial sum-rate monotonicity: As users' queues grow linearly, the scheduler allocates service in a manner that deemphasizes the balancing of unequal queues in favor of maximizing current system throughput (being opportunistic). This is in sharp contrast to previously proposed throughput-optimal policies, e.g., Exp rule and MaxWeight (with any positive exponent of queue length). In order to meet performance and robustness objectives, we propose a new class of policies, called the Log rule, that are radial sum-rate monotone (RSM) and provably throughput-optimal. In fact, it can also be shown that an RSM policy minimizes the asymptotic probability of sum-queue overflow. We use extensive simulations to explore various possible design objectives for opportunistic schedulers. When users see heterogenous channels, we find that emphasizing queue balancing, e.g., Exp rule and MaxWeight, may excessively compromise the overall delay. Finally, we discuss approaches to implement the proposed policies for scheduling and resource allocation in OFDMA-based multichannel systems.

Original languageEnglish
Article number5559458
Pages (from-to)405-418
Number of pages14
JournalIEEE/ACM Transactions on Networking
Volume19
Issue number2
DOIs
Publication statusPublished - 2011 Apr 1

Fingerprint

Scheduling
Throughput
Resource allocation

Keywords

  • Delay/throughput optimality
  • Markov decision process
  • OFDMA resource allocation
  • opportunistic scheduling
  • radial sum-rate monotonicity (RSM)

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Software
  • Electrical and Electronic Engineering

Cite this

Delay-optimal opportunistic scheduling and approximations : The log rule. / Sadiq, Bilal; Baek, Seung Jun; De Veciana, Gustavo.

In: IEEE/ACM Transactions on Networking, Vol. 19, No. 2, 5559458, 01.04.2011, p. 405-418.

Research output: Contribution to journalArticle

@article{8658603056684139af5e83e3680561cd,
title = "Delay-optimal opportunistic scheduling and approximations: The log rule",
abstract = "This paper considers the design of multiuser opportunistic packet schedulers for users sharing a time-varying wireless channel from performance and robustness points of view. For a simplified model falling in the classical Markov decision process framework, we numerically compute and characterize mean-delay-optimal scheduling policies. The computed policies exhibit radial sum-rate monotonicity: As users' queues grow linearly, the scheduler allocates service in a manner that deemphasizes the balancing of unequal queues in favor of maximizing current system throughput (being opportunistic). This is in sharp contrast to previously proposed throughput-optimal policies, e.g., Exp rule and MaxWeight (with any positive exponent of queue length). In order to meet performance and robustness objectives, we propose a new class of policies, called the Log rule, that are radial sum-rate monotone (RSM) and provably throughput-optimal. In fact, it can also be shown that an RSM policy minimizes the asymptotic probability of sum-queue overflow. We use extensive simulations to explore various possible design objectives for opportunistic schedulers. When users see heterogenous channels, we find that emphasizing queue balancing, e.g., Exp rule and MaxWeight, may excessively compromise the overall delay. Finally, we discuss approaches to implement the proposed policies for scheduling and resource allocation in OFDMA-based multichannel systems.",
keywords = "Delay/throughput optimality, Markov decision process, OFDMA resource allocation, opportunistic scheduling, radial sum-rate monotonicity (RSM)",
author = "Bilal Sadiq and Baek, {Seung Jun} and {De Veciana}, Gustavo",
year = "2011",
month = "4",
day = "1",
doi = "10.1109/TNET.2010.2068308",
language = "English",
volume = "19",
pages = "405--418",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - Delay-optimal opportunistic scheduling and approximations

T2 - The log rule

AU - Sadiq, Bilal

AU - Baek, Seung Jun

AU - De Veciana, Gustavo

PY - 2011/4/1

Y1 - 2011/4/1

N2 - This paper considers the design of multiuser opportunistic packet schedulers for users sharing a time-varying wireless channel from performance and robustness points of view. For a simplified model falling in the classical Markov decision process framework, we numerically compute and characterize mean-delay-optimal scheduling policies. The computed policies exhibit radial sum-rate monotonicity: As users' queues grow linearly, the scheduler allocates service in a manner that deemphasizes the balancing of unequal queues in favor of maximizing current system throughput (being opportunistic). This is in sharp contrast to previously proposed throughput-optimal policies, e.g., Exp rule and MaxWeight (with any positive exponent of queue length). In order to meet performance and robustness objectives, we propose a new class of policies, called the Log rule, that are radial sum-rate monotone (RSM) and provably throughput-optimal. In fact, it can also be shown that an RSM policy minimizes the asymptotic probability of sum-queue overflow. We use extensive simulations to explore various possible design objectives for opportunistic schedulers. When users see heterogenous channels, we find that emphasizing queue balancing, e.g., Exp rule and MaxWeight, may excessively compromise the overall delay. Finally, we discuss approaches to implement the proposed policies for scheduling and resource allocation in OFDMA-based multichannel systems.

AB - This paper considers the design of multiuser opportunistic packet schedulers for users sharing a time-varying wireless channel from performance and robustness points of view. For a simplified model falling in the classical Markov decision process framework, we numerically compute and characterize mean-delay-optimal scheduling policies. The computed policies exhibit radial sum-rate monotonicity: As users' queues grow linearly, the scheduler allocates service in a manner that deemphasizes the balancing of unequal queues in favor of maximizing current system throughput (being opportunistic). This is in sharp contrast to previously proposed throughput-optimal policies, e.g., Exp rule and MaxWeight (with any positive exponent of queue length). In order to meet performance and robustness objectives, we propose a new class of policies, called the Log rule, that are radial sum-rate monotone (RSM) and provably throughput-optimal. In fact, it can also be shown that an RSM policy minimizes the asymptotic probability of sum-queue overflow. We use extensive simulations to explore various possible design objectives for opportunistic schedulers. When users see heterogenous channels, we find that emphasizing queue balancing, e.g., Exp rule and MaxWeight, may excessively compromise the overall delay. Finally, we discuss approaches to implement the proposed policies for scheduling and resource allocation in OFDMA-based multichannel systems.

KW - Delay/throughput optimality

KW - Markov decision process

KW - OFDMA resource allocation

KW - opportunistic scheduling

KW - radial sum-rate monotonicity (RSM)

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

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

U2 - 10.1109/TNET.2010.2068308

DO - 10.1109/TNET.2010.2068308

M3 - Article

AN - SCOPUS:79955482963

VL - 19

SP - 405

EP - 418

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 2

M1 - 5559458

ER -