Performance bounds of distributed CSMA scheduling

Libin Jiang, Jian Ni, Rayadurgam Srikant, Jean Walrand

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publication2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings
Pages204-209
Number of pages6
DOIs
StatePublished - May 31 2010
Event2010 Information Theory and Applications Workshop, ITA 2010 - San Diego, CA, United States
Duration: Jan 31 2010Feb 5 2010

Publication series

Name2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings

Other

Other2010 Information Theory and Applications Workshop, ITA 2010
CountryUnited States
CitySan Diego, CA
Period1/31/102/5/10

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Fingerprint Dive into the research topics of 'Performance bounds of distributed CSMA scheduling'. Together they form a unique fingerprint.

  • Cite this

    Jiang, L., Ni, J., Srikant, R., & Walrand, J. (2010). Performance bounds of distributed CSMA scheduling. In 2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings (pp. 204-209). [5454123] (2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings). https://doi.org/10.1109/ITA.2010.5454123