A New Scheduling Algorithm for Minimizing The Queue Over-Flow Probability in Cellular Networks

The use of optimization and economic ideas in network resource allocation has a long history, going back to the study of transportation networks. The proposal is to use as adaptation variables the components of rate for each path from source to destination. In this paper, a wireless scheduling algorithms for the downlink of a single cell hat can minimize the queue-overflow probability is developed. Specifically, in a large-deviation setting, the authors are interested in algorithms that maximize the asymptotic decay rate of the queue-overflow probability, as the queue-overflow threshold approaches infinity. They derived an upper bound on the decay rate of the queue-overflow probability over all scheduling policies.