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.
Type de document :
Communication dans un congrès
Fernando A. Kuipers; Poul E. Heegaard. 6th International Workshop on Self-Organizing Systems (IWSOS), Mar 2012, Delft, Netherlands. Springer, Lecture Notes in Computer Science, LNCS-7166, pp.104-108, 2012, Self-Organizing Systems. 〈10.1007/978-3-642-28583-7_11〉
Liste complète des métadonnées

Littérature citée [7 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01527536
Contributeur : Hal Ifip <>
Soumis le : mercredi 24 mai 2017 - 15:24:09
Dernière modification le : mercredi 24 mai 2017 - 15:27:27
Document(s) archivé(s) le : lundi 28 août 2017 - 16:43:26

Fichier

978-3-642-28583-7_11_Chapter.p...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Alexander Gogolev, Christian Bettstetter. Robustness of Self-Organizing Consensus Algorithms: Initial Results from a Simulation-Based Study. Fernando A. Kuipers; Poul E. Heegaard. 6th International Workshop on Self-Organizing Systems (IWSOS), Mar 2012, Delft, Netherlands. Springer, Lecture Notes in Computer Science, LNCS-7166, pp.104-108, 2012, Self-Organizing Systems. 〈10.1007/978-3-642-28583-7_11〉. 〈hal-01527536〉

Partager

Métriques

Consultations de la notice

32

Téléchargements de fichiers

21