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