Effective bandwidths for multiclass Markov fluids and other ATM sources
IEEE/ACM Transactions on Networking (TON)
The impact of imperfect scheduling on cross-layer congestion control in wireless networks
IEEE/ACM Transactions on Networking (TON)
Large Deviations of Queues Sharing a Randomly Time-Varying Server
Queueing Systems: Theory and Applications
On scheduling for minimizing end-to-end buffer usage over multihop wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
On wireless scheduling algorithms for minimizing the queue-overflow probability
IEEE/ACM Transactions on Networking (TON)
Effective capacity: a wireless link model for support of quality of service
IEEE Transactions on Wireless Communications
A Large Deviations Analysis of Scheduling in Wireless Networks
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In this paper, we are interested in using large-deviations 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 Q-SCHED. 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 queue-overflow probability, Q-SCHED can support a provable fraction of the offered loads achievable by any algorithms.