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
Scheduling in multi-channel wireless networks: rate function optimality in the small-buffer regime
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
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 Energy and Delay Tradeoffs for Multiuser Wireless Downlinks
IEEE Transactions on Information Theory
Delay-optimal opportunistic scheduling and approximations: the log rule
IEEE/ACM Transactions on Networking (TON)
Low-complexity scheduling algorithms for multichannel downlink wireless networks
IEEE/ACM Transactions on Networking (TON)
Approaching throughput optimality with limited feedback in multichannel wireless downlink networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM) wireless downlink networks with n users/OFDM sub-channels. For this system, while the classical MaxWeight algorithm is known to be throughput-optimal, its buffer-overflow performance is very poor (formally, we show it has zero rate function in our setting). To address this, we propose a class of algorithms called iHLQF (iterated Heaviest matching with Longest Queues First) that is shown to be throughput optimal for a general class of arrival/channel processes, and also rate-function optimal (i.e., exponentially small buffer overflow probability) for certain arrival/channel processes. iHLQF however has higher complexity than MaxWeight (n4 vs. n2 respectively). To overcome this issue, we propose a new algorithm called SSG (Server-Side Greedy). We show that SSG is throughput optimal, results in a much better per-user buffer overflow performance than the MaxWeight algorithm (positive rate function for certain arrival/channel processes), and has a computational complexity (n2) that is comparable to the MaxWeight algorithm. Thus, it provides a nice trade-off between buffer-overflow performance and computational complexity. These results are validated by both analysis and simulations.