Leader Election Algorithms
This chapter is on the leader election problem. Electing a leader consists for the processes of a distributed system in selecting one of them. Usually, once elected, the leader process is required to play a special role for coordination or control purposes.
Leader election is a form of symmetry breaking in a distributed system. After showing that no leader can be elected in anonymous regular networks (such as rings), this chapter presents several leader election algorithms with a special focus on non-anonymous ring networks.
KeywordsAnonymous network Election Message complexity Process identity Ring network Time complexity Unidirectional versus bidirectional ring
- 19.D. Angluin, Local and global properties in networks of processors, in Proc. 12th ACM Symposium on Theory of Computation (STOC’81) (ACM Press, New York, 1981), pp. 82–93 Google Scholar
- 232.G. Le Lann, Distributed systems: towards a formal approach, in IFIP World Congress, (1977), pp. 155–160 Google Scholar