The Community for Technology Leaders
RSS Icon
Subscribe
Niagara Falls, ON
May 21, 2007 to May 23, 2007
ISBN: 0-7695-2846-5
pp: 673-678
Matthias Wiesmann , Japan Advanced Institute of Science and Technology
Xavier Defago , Japan Advanced Institute of Science and Technology
ABSTRACT
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.
INDEX TERMS
null
CITATION
Matthias Wiesmann, Xavier Defago, "Anonymous Stabilizing Leader Election using a Network Sequencer", AINA, 2007, 21st International Conference on Advanced Information Networking and Applications (AINA '07), 21st International Conference on Advanced Information Networking and Applications (AINA '07) 2007, pp. 673-678, doi:10.1109/AINA.2007.38
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool