Message complexity of simple ring-based election algorithms-an empirical analysis
Friedemann Mattern · 2003
Several variants of the simple Chang-Roberts algorithm are simulated. The empirical analysis shows that the algorithms compare very favorably to other ring-based election algorithms. For various ring sizes and numbers of concurrent starters the average message complexity, its distribution, and its standard deviation were studied. Simulation results show that the algorithm is far better than the rather conservative mathematical estimations indicate.>