Mobility

Scheduling in Multi-Channel Wireless Networks: Rate Function Optimality in the Small-Buffer Regime

Download Now Free registration required

Executive Summary

The authors 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. The authors 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.

  • Format: PDF
  • Size: 461.3 KB