Open Access
Subscription Access
Fault Tolerant Leader Election in Distributed Systems
There are many distributed systems which use a leader in their logic. When such systems need to be fault tolerant and the current leader suffers a technical problem, it is necessary to apply a special algorithm in order to choose a new leader. In this paper I present a new fault tolerant algorithm which elects a new leader based on a random roulette wheel selection.
Keywords
Leader Election, Fault Tolerance, Distributed Systems.
User
Font Size
Information
- J. Gray and L. Lamport. Consensum on transaction commit. 2004.
- H. Garcia-Molina. Elections in a distributed computing system. IEEE Transactions on Computers, (1):48– 59, 1982.
- S. Basu. An efficient approach of election algorithm in distributed systems. Indian Journal of Computer Science and Engineering (IJCSE), 2(1):16–21, 2011.
- S.-H. Park. A stable election protocol based on an unreliable failure detector in distributed systems.
- Proceedings of IEEE Eighth International Conference on Information Technology: New Generations, pages 976– 984, 2011.
- A. Silberschatz, P. B. Galvin, and G. Gagne. Operating Systems Concepts. John Wiley & Sons. Inc, 7 edition, 2005.
- D. Ongaro and J. Ousterhout. In search of an understandable consensus algorithm (extended version).
- M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the Association for Computing Machinery, 32(2):398–407, 1985.
Abstract Views: 335
PDF Views: 145