Robustness of Self-Organizing Consensus Algorithms: Initial Results from a Simulation-Based Study
Résumé
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.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...
