Robustness of self-organizing consensus algorithms: initial results from a simulation-based study

  • Authors:

  • Alexander Gogolev;Christian Bettstetter

  • Affiliations:

  • Institute of Networked and Embedded Systems, University of Klagenfurt, Austria;Institute of Networked and Embedded Systems, University of Klagenfurt, Austria and Lakeside Labs GmbH, Klagenfurt, Austria

  • Venue:
  • IWSOS'12 Proceedings of the 6th IFIP TC 6 international conference on Self-Organizing Systems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

This short paper studies distributed consensus algorithms with focus on their robustness against communication errors. We report simulation results to verify and assess existing algorithms. Gacs-Kurdyumov-Levin and simple majority rule are evaluated in terms of convergence rate and speed as a function of noise and network topology.