Low-complexity Scheduling Algorithms for Multi-channel Downlink Wireless Networks

—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 ra...

• Type: Journal
• Year: 2010
• Where: INFOCOM
• Authors: Shreeshankar Bodas, Sanjay Shakkottai, Lei Ying, R. Srikant
• Keywords: Algorithm, Communications, INFOCOM 2010, MaxWeight Algorithm, Rate Function