TY - GEN
T1 - Performance bounds of distributed CSMA scheduling
AU - Jiang, Libin
AU - Ni, Jian
AU - Srikant, R.
AU - Walrand, Jean
PY - 2010
Y1 - 2010
N2 - CSMA-based scheduling is a recently proposed distributed scheduling algorithm that is shown to achieve the maximal throughput. Central to this algorithm is a Markov chain that produces samples from a desired distribution. In this work, we discuss the relationships of the achievable throughput, queueing delay and the mixing time of the Markov chain in a variant of the algorithm. This result suggests that a small mixing time is desirable for low delay. We then discuss how a generic bound on the mixing time can be tightened in specific topologies.
AB - CSMA-based scheduling is a recently proposed distributed scheduling algorithm that is shown to achieve the maximal throughput. Central to this algorithm is a Markov chain that produces samples from a desired distribution. In this work, we discuss the relationships of the achievable throughput, queueing delay and the mixing time of the Markov chain in a variant of the algorithm. This result suggests that a small mixing time is desirable for low delay. We then discuss how a generic bound on the mixing time can be tightened in specific topologies.
UR - http://www.scopus.com/inward/record.url?scp=77952684893&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77952684893&partnerID=8YFLogxK
U2 - 10.1109/ITA.2010.5454123
DO - 10.1109/ITA.2010.5454123
M3 - Conference contribution
AN - SCOPUS:77952684893
SN - 9781424470143
T3 - 2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings
SP - 204
EP - 209
BT - 2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings
T2 - 2010 Information Theory and Applications Workshop, ITA 2010
Y2 - 31 January 2010 through 5 February 2010
ER -