The unidirectional version and several bidirectional variants of the simple 
and well-known Chang/Roberts algorithm have been simulated. The empirical 
analysis complements previous mathematical analyses and shows that the 
algorithms compare very favorably with other ring-based election algorithms. 
For various ring sizes and number of concurrent starters the average message 
complexity, its distribution, and its standard deviation are studied.