Robustness of Self-Organizing Consensus Algorithms: Initial Results from a Simulation-Based Study
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.
KeywordsNetworked systems self-organization consensus robustness
- 2.Gacs, P., Kurdyumov, G.L., Levin, L.A.: One dimensional uniform arrays that wash out finite islands (in Russian). Problemy Peredachi Informatsii 14, 92–98 (1978)Google Scholar
- 4.Heyes, C.M., Galef Jr., B.G. (eds.): Social Learning in Animals: The Roots of Culture. Academic Press, San Diego (1996)Google Scholar
- 5.Watts, D.J.: Small Worlds: The Dynamics of Networks Between Order and Randomness. Princeton University Press (1999)Google Scholar