Skip to Main content Skip to Navigation
Conference papers

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

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.
Complete list of metadatas

Cited literature [6 references]  Display  Hide  Download

https://hal.inria.fr/hal-01527536
Contributor : Hal Ifip <>
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

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

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⟩

Share

Metrics

Record views

80

Files downloads

165