On the queue-overflow probabilities of a class of distributed scheduling algorithms

• Published in: Computer networks (Amsterdam, Netherlands : 1999) Vol. 55; no. 1; pp. 343 - 355
• Main Authors: Zhao, Can, Lin, Xiaojun
• Format: Journal Article
• Language: English
• Published: Kidlington Elsevier B.V 07.01.2011; Elsevier; Elsevier Sequoia S.A
• Subjects: Algorithms; Applied sciences; Asymptotic properties; Business and industry local networks; C (programming language); Decay rate; Distributed processing; Exact sciences and technology; Large deviations; Links; Miscellaneous; Networks; Networks and services in france and abroad; Operation, maintenance, reliability; Probability; Quality of service; Queues; Queuing; Scheduling; Scheduling algorithms; Studies; Systems, networks and services of telecommunications; Telecommunications; Telecommunications and information theory; Teleprocessing networks. Isdn; Teletraffic; Wireless networks; Scheduling algorithms; Large deviations; Wireless networks; Quality of service; Overflow(computer arithmetics); Lower bound; Wireless telecommunication; Asymptotic behavior; Teletraffic; Scheduling; Large deviation; Upper bound; Queueing system; Traffic management; Distributed algorithm; Traffic control; Wireless network; Ad hoc network; Service quality
• ISSN: 1389-1286; 1872-7069
• DOI: 10.1016/j.comnet.2010.08.007

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.