An upper bound on the convergence time for distributed binary consensus

Shang Shang, Paul W. Cuff, Sanjeev R. Kulkarni, Pan Hui

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

7 Scopus citations

Abstract

The problem addressed in this paper is the analysis of a distributed consensus algorithm for arbitrary networks, proposed by Bénézit et al. In the initial setting, each node in the network has one of two possible states ("yes" or "no"). Nodes can update their states by communicating with their neighbors via a 2-bit message in an asynchronous clock setting. Eventually, all nodes reach consensus on the majority states. We use the theory of electric networks, random walks, and couplings of Markov chains to derive an O(N 4 log N) upper bound for the expected convergence time on an arbitrary graph of size N.

Original languageEnglish (US)
Title of host publication15th International Conference on Information Fusion, FUSION 2012
Pages369-375
Number of pages7
StatePublished - Oct 24 2012
Event15th International Conference on Information Fusion, FUSION 2012 - Singapore, Singapore
Duration: Sep 7 2012Sep 12 2012

Publication series

Name15th International Conference on Information Fusion, FUSION 2012

Other

Other15th International Conference on Information Fusion, FUSION 2012
CountrySingapore
CitySingapore
Period9/7/129/12/12

All Science Journal Classification (ASJC) codes

  • Information Systems

Keywords

  • Distributed binary consensus
  • convergence time
  • gossip

Fingerprint Dive into the research topics of 'An upper bound on the convergence time for distributed binary consensus'. Together they form a unique fingerprint.

  • Cite this

    Shang, S., Cuff, P. W., Kulkarni, S. R., & Hui, P. (2012). An upper bound on the convergence time for distributed binary consensus. In 15th International Conference on Information Fusion, FUSION 2012 (pp. 369-375). [6289826] (15th International Conference on Information Fusion, FUSION 2012).