Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Robustness of Self-Organizing Consensus Algorithms: Initial Results from a Simulation-Based Study

Alexander Gogolev 1 Christian Bettstetter 1 
1 NES - Institute of Networked and Embedded Systems
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.
Keywords : Networked systems self-organization consensus robustness
Document type :
Conference papers
Complete list of metadata

Cited literature [6 references]  Display  Hide  Download
https://hal.inria.fr/hal-01527536
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2017 - 3:24:09 PM
Last modification on : Wednesday, May 24, 2017 - 3:27:27 PM
Long-term archiving on: : Monday, August 28, 2017 - 4:43:26 PM

File

Vignette du document
978-3-642-28583-7_11_Chapter.p...
Files produced by the author(s)

Licence

Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Collections

IFIP-LNCS | IFIP | IFIP-TC | IFIP-TC6 | IFIP-IWSOS | IFIP-LNCS-7166

Citation

Alexander Gogolev, Christian Bettstetter. Robustness of Self-Organizing Consensus Algorithms: Initial Results from a Simulation-Based Study. 6th International Workshop on Self-Organizing Systems (IWSOS), Mar 2012, Delft, Netherlands. pp.104-108, ⟨10.1007/978-3-642-28583-7_11⟩. ⟨hal-01527536⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

27

Files downloads

79

 

Contact                    Legal Notice                    Personal Data