Scheduling in multi-channel wireless networks: rate function optimality in the small-buffer regime

Authors:
Shreeshankar Bodas;Sanjay Shakkottai;Lei Ying;R. Srikant
Affiliations:
The University of Texas at Austin, Austin, TX, USA;The University of Texas at Austin, Austin, TX, USA;Iowa State University, Ames, IA, USA;University of Illinois at Urbana-Champaign, Urbana, IL, USA
Venue:
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Year:
2009

Citing 6
Cited 6

Algorithm Design

Algorithm Design
Stable scheduling policies for fading wireless channels

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

Queueing Systems: Theory and Applications
Stability and Asymptotic Optimality of Generalized MaxWeight Policies

SIAM Journal on Control and Optimization
A Large Deviations Analysis of Scheduling in Wireless Networks

IEEE Transactions on Information Theory
Optimal Transmission Scheduling in Symmetric Communication Models With Intermittent Connectivity

IEEE Transactions on Information Theory

Low-complexity scheduling algorithms for multi-channel downlink wireless networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
Performance of low-feedback-rate, gradient-based OFDMA subcarrier allocation with partial channel information

ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
Scheduling algorithms for multicarrier wireless data systems

IEEE/ACM Transactions on Networking (TON)
Low-complexity scheduling algorithms for multichannel downlink wireless networks

IEEE/ACM Transactions on Networking (TON)
Buffer occupation in wireless social networks

WASA'13 Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications
Approaching throughput optimality with limited feedback in multichannel wireless downlink networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of designing scheduling algorithms for the downlink of cellular wireless networks where bandwidth is partitioned into tens to hundreds of parallel channels, each of which can be allocated to a possibly different user in each time slot. We prove that a class of algorithms called Iterated Longest Queues First (iLQF) algorithms achieves the smallest buffer overflow probability in an appropriate large deviations sense. The class of iLQF algorithms is quite different from the class of max-weight policies which have been studied extensively in the literature, and it achieves much better performance in the regimes studied in this paper.