Large deviations sum-queue optimality of a radial sum-rate monotone opportunistic scheduler

Authors:
Bilal Sadiq;Gustavo De Veciana
Affiliations:
Department of Electrical and Computer Engineering, Cockrell School of Engineering, The University of Texas at Austin, Austin, TX;Department of Electrical and Computer Engineering, Cockrell School of Engineering, The University of Texas at Austin, Austin, TX
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 8
Cited 2

A framework for opportunistic scheduling in wireless networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES

Probability in the Engineering and Informational Sciences
Stable scheduling policies for fading wireless channels

IEEE/ACM Transactions on Networking (TON)
User-level performance of channel-aware scheduling algorithms in wireless data networks

IEEE/ACM Transactions on Networking (TON)
Large Deviations of Queues Sharing a Randomly Time-Varying Server

Queueing Systems: Theory and Applications
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
Markov Chains and Stochastic Stability

Markov Chains and Stochastic Stability
On the large-deviations optimality of scheduling policies minimizing the drift of a Lyapunov function

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing

Downlink scheduling for multiclass traffic in LTE

EURASIP Journal on Wireless Communications and Networking - 3GPP LTE and LTE Advanced
Delay-optimal opportunistic scheduling and approximations: the log rule

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	754.84

Visualization

Abstract

A centralized wireless system is considered that is serving a fixed set of users with time varying channel capacities. An opportunistic scheduling rule in this context selects a user (or users) to serve based on the current channel state and user queues. Unless the user traffic is symmetric and/or the underlying capacity region a polymatroid, little is known concerning how performance optimal schedulers should tradeoff maximizing current service rate (being opportunistic) versus balancing unequal queues (enhancing user-diversity to enable future high service rate opportunities). By contrast, with currently proposed opportunistic schedulers, e.g., MaxWeight and Exp Rule, a radial sum-rate monotonic (RSM) scheduler de-emphasizes queue-balancing in favor of greedily maximizing the system service rate as the queue-lengths are scaled up linearly. In this paper, it is shown that an RSM opportunistic scheduler, p-Log Rule, is not only throughput-optimal, but also maximizes the asymptotic exponential decay rate of the sum-queue distribution for a two-queue system. The result complements existing optimality results for opportunistic scheduling and point to RSM schedulers as a good design choice given the need for robustness in wireless systems with both heterogeneity and high degree of uncertainty.