On the queue-overflow probabilities of distributed scheduling algorithms

Abstract-- In this paper, we are interested in using largedeviations theory to characterize the asymptotic decay-rate of the queue-overflow probability for distributed wireless scheduling algorithms, as the overflow threshold approaches infinity. We consider ad-hoc wireless networks where each link interferes with a given set of other links, and we focus on a distributed scheduling algorithm called Q-SCHED, which is introduced by Gupta et al. First, we derive a lower bound on the asymptotic decay rate of the queue-overflow probability for QSCHED. We then present an upper bound on the decay rate for all possible algorithms operating on the same network. Finally, using these bounds, we are able to conclude that, subject to a given constraint on the asymptotic decay rate of the queueoverflow probability, Q-SCHED can support a provable fraction of the offered loads achievable by any algorithms.

• Type: Conference
• Year: 2009
• Where: CDC
• Authors: Can Zhao, Xiaojun Lin
• Keywords: Asymptotic Decay Rate, CDC 2009, Control Systems, Decay Rate, Scheduling Algorithm