Vinay Kumar Madhadi. CSC-8320. LEADER ELECTION. 09/23/2009. Outline. Part 1 : Leader Election? Part 2 : Different Design Topologies Algorithms Used-Bully, Ring , Invitation Recent Studies Part 3 : Future work. Part 1: What is Leader Election?.
Vinay Kumar Madhadi
Algorithms Used-Bully, Ring , Invitation
(Chow et al, 1997)
(Garcia, Molina 1982)
(Chow et al , 1997)
The main concern is usually the fast and successful completion of election process.
There are three design topologies employed
COMPLETE & LOCAL RING TOPOLOGY:
Advantage: Overall latency is reduced.
(Vojdani, Taj, 2009)
2. Conventional algorithms in distributed systems present particular methods to resolve any leader crash. A new method based on electing a leader and assistant was introduced. If the leader crashes, the assistant takes care of the leader's responsibilities.
(Vasudevan, Kurose, Towsley, 2003)
(Tanenbaum, Steen, 2007)
MehdiVojdani, K. Yaser Taj, DR: Divided Ring leader Election Algorithm ( July 2009)
Tanenbaum, S., Steen, M.V.: DISTRIBUTED SYSTEMS: Principles and Paradigms, p.2e. Prentice Hall, Inc, Englewood Cliffs (2007)
Zargarnataj, M.: New Election Algorithm based on Assistant in Distributed Systems. In: AICCSA 2007, May 2007, pp. 324–331 (2007)
Vasudevan, S., DeCleene, B., Immerman, N., Kurose, J., Towsley, D.: Leader Election Algorithms for Wireless Ad Hoc Networks. In: DARPA Information Survivability Conference and Exposition, April 2003, pp. 261–272 (2003)
Distributed Systems principles and paradigms by Andrew S. Tanenbaum, Maarten van Steen, 2002.
Stoller, S.D.: Leader Election in Asynchronous Distributed Systems. IEEE Transactions on Computers, 283–284 (March 2000)