Leader Election: From Higham-Przytycka's Algorithm to a Gracefully Degrading Algorithm

Abstract

The leader election problem consists in selecting a process (called leader) in a group of processes. Several leader election algorithms have been proposed in the past for ring networks, tree networks, fully connected networks or regular networks (such as tori and hyper cubes). As far as ring networks are concerned, it has been shown that the number of messages that processes have to exchange to elect a leader is Omega(n\log n). The algorithm proposed by High am and Przytycka is the best leader algorithm known so far for ring networks in terms of message complexity, which is 1.271~n\log n +O(n). This algorithm uses round numbers and assumes that all processes start with the same round number. More precisely, when round numbers are not initially equal, the algorithm has runs that do not terminate. This paper presents an algorithm, based on Higham-Przytycka' stechnique, which allows processes to start with different round numbers. This extension is motivated by fault-tolerance with respect to initial values. While the algorithm always terminates, its message complexity is optimal, i.e., O(n\log n), when the processes start with the same round number and increases up to O(n^2) when all processes start with different round number values. We call graceful degradation this additional property that combines fault-tolerance (with respect to initial values) and efficiency.