Analysis for Minimizing the Queue Overflow Probability on Wireless by Scheduling Algorithms

In this paper, we are interested in wireless scheduling algorithms for the downlink of a single cell that can minimize the queue-overflow probability. Link scheduling is an important functionality in wireless networks due to both the shared nature of the wireless medium and the variations of the wireless channel over time. Scheduling algorithms have focused on optimizing the long term average throughput of the users. The goal is to find algorithms for scheduling the transmissions such that the queues are stabilized at given offered loads. α – algorithm is a class of scheduling algorithm that is used to minimize the queue overflow probability. α is a parameter that takes values from the set of natural numbers. In this paper, to circumvent the difficulty of the multidimensional calculus-of-variations (CoV) problem, use Lyapunov function to map the multidimensional CoV problem to a one dimensional problem, which allows us to bound the minimum cost to overflow by solutions of simple vector-optimization problems. The advantage of working with the α – algorithm instead of exponential rule is that the α – algorithms are scale invariant