Self-stabilizing leader election in polynomial steps

In this paper, we propose a silent self-stabilizing leader election algorithm for bidirectional con-nected identified networks of arbitrary topology. This algorithm is written in the locally shared memory model. It assumes the distributed unfair daemon, the most general scheduling hypothesis of the model. Our algorithm requires no global knowledge on the network (such as an upper bound on the diameter or the number of processes, for example). We show that its stabilization time is in Θ(n3) steps in the worst case, where n is the number of processes. To the best of our knowledge, this is the first self-stabilizing leader election algorithm for arbitrary identified networks that is proved to achieve a stabilization time polynomial in steps. Its memory requirement is asymptotically optimal, i.e., Θ(logn) bits per processes. Its round complexity is of the same order of magnitude — i.e., Θ(n) rounds — as the best existing algorithms designed with similar settings (i.e., those that do not use global knowledge and that are proved under the unfair daemon)