2013 IEEE 27th International Conference on Advanced Information Networking and Applications (AINA) (2007)
Niagara Falls, Ontario, Canada
May 21, 2007 to May 23, 2007
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AINA.2007.38
Matthias Wiesmann , Japan Advanced Institute of Science and Technology
Xavier Defago , Japan Advanced Institute of Science and Technology
In this paper, we present an anonymous, stable, communication efficient, stabilizing leader election algorithm that works using anonymous communication primitives. The algorithm offers properties similar to that of the W failure detector, with the added property of totally ordering the sequence of proposed leaders. The algorithm does not need to know beforehand the identity or the number of processes in the system, and operates using a constant amount of memory. We present the algorithm, discuss performance issues and optimizations and present experimental results of a prototype implementation.
Matthias Wiesmann, Xavier Defago, "Anonymous Stabilizing Leader Election using a Network Sequencer", 2013 IEEE 27th International Conference on Advanced Information Networking and Applications (AINA), vol. 00, no. , pp. 673-678, 2007, doi:10.1109/AINA.2007.38