DMCA
Pathwise optimality of the exponential scheduling rule for wireless channels (2004)
Cached
Download Links
| Venue: | Advances in Applied Probability |
| Citations: | 61 - 19 self |
BibTeX
@INPROCEEDINGS{Shakkottai04pathwiseoptimality,
author = {Sanjay Shakkottai and R. Srikant and Alexander L. Stolyar},
title = {Pathwise optimality of the exponential scheduling rule for wireless channels},
booktitle = {Advances in Applied Probability},
year = {2004},
pages = {2004}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We consider the problem of scheduling transmissions of multiple data users (flows) sharing the same wireless channel (server). The unique feature of this problem is the fact that the capacity (service rate) of the channel varies randomly with time and asynchronously for different users. We study a scheduling policy called Exponential scheduling rule, which was introduced in an earlier paper. Given a system with N users, and any set of positive numbers {an},n = 1,2,...,N, we show that in a heavy-traffic limit, under a non-restrictive complete resource pooling condition, this algorithm has the property that, for each time t, it (asymptotically) minimizes maxn an˜qn(t), where ˜qn(t) is user n queue length in the heavy traffic regime.
