Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(10)
Ad Hoc Wireless Network
Decay Rate
Distributed Scheduling
Large Deviation
Large Deviation Theory
Quality of Service
Scheduling Algorithm
Upper Bound
Wireless Network
Lower Bound
Subscribe
Academic
Publications
On the queueoverflow probabilities of a class of distributed scheduling algorithms
On the queueoverflow probabilities of a class of distributed scheduling algorithms,10.1016/j.comnet.2010.08.007,Computer Networks,Can Zhao,Xiaojun Li
Edit
On the queueoverflow probabilities of a class of distributed scheduling algorithms
BibTex

RIS

RefWorks
Download
Can Zhao
,
Xiaojun Lin
In this paper, we are interested in using largedeviations theory to characterize the asymptotic decayrate of the queueoverflow 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 QSCHED, which is introduced by Gupta et al. First, we derive a
lower bound
on the asymptotic
decay rate
of the queueoverflow 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, QSCHED can support a provable fraction of the offered loads achievable by any algorithms.
Journal:
Computer Networks  COMPUT NETW
, vol. 55, no. 1, pp. 343355, 2011
DOI:
10.1016/j.comnet.2010.08.007
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.sciencedirect.com
)
(
www.informatik.unitrier.de
)
(
dx.doi.org
)
References
(9)
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
(
Citations: 916
)
Leandros Tassiulas
,
Anthony Ephremides
Journal:
IEEE Transactions on Automatic Control  IEEE TRANS AUTOMAT CONTR
, vol. 37, no. 12, pp. 19361948, 1992
The impact of imperfect scheduling on crosslayer congestion control in wireless networks
(
Citations: 122
)
Xiaojun Lin
,
Ness B. Shroff
Journal:
IEEE/ACM Transactions on Networking  TON
, vol. 14, no. 2, pp. 302315, 2006
Effective bandwidths for multiclass Markov fluids and other ATM sources
(
Citations: 384
)
George Kesidis
,
Jean C. Walrand
,
ChengShang Chang
Journal:
IEEE/ACM Transactions on Networking  TON
, vol. 1, no. 4, pp. 424428, 1993
Effective capacity: a wireless link model for support of quality of service
(
Citations: 275
)
Dapeng Wu
,
Rohit Negi
Journal:
IEEE Transactions on Wireless Communications  TWC
, vol. 2, no. 4, pp. 630643, 2003
A Large Deviations Analysis of Scheduling in Wireless Networks
(
Citations: 40
)
Lei Ying
,
R. Srikant
,
Atilla Eryilmaz
,
Geir E. Dullerud
Journal:
IEEE Transactions on Information Theory  TIT
, vol. 52, no. 11, pp. 50885098, 2006