Fault Tolerant Message Efficient Coordinator Election Algorithm in High Traffic Bidirectional Ring Network

Nowadays use of distributed systems such as internet and cloud computing is growing dramatically. Coordinator existence in these systems is crucial due to processes coordinating and consistency requirement as well. However the growth makes their election algorithm even more complicated. Too many algorithms are proposed in this area but the two most well known one are Bully and Ring. In this paper we propose a fault tolerant coordinator election algorithm in typical bidirectional ring topology which is twice as fast as Ring algorithm although far fewer messages are passing due to election. Fault tolerance technique is applied which leads the waiting time for the election reaching to zero.

[1]  Jennifer L. Welch,et al.  An asynchronous leader election algorithm for dynamic networks , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[2]  Long Hong,et al.  A bi-directional election algorithm based on ring topology , 2011, International Conference on Information Science and Technology.

[3]  Jan K. Pachl,et al.  Uniform Self-Stabilizing Rings , 1988, AWOC.

[4]  Danny Dolev,et al.  An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle , 1982, J. Algorithms.

[5]  Nancy A. Lynch,et al.  Electing a leader in a synchronous ring , 1987, JACM.

[6]  Yehuda Afek,et al.  Time and message bounds for election in synchronous and asynchronous complete networks , 1985, PODC '85.

[7]  Prithwish Basu,et al.  A mobility based metric for clustering in mobile ad hoc networks , 2001, Proceedings 21st International Conference on Distributed Computing Systems Workshops.

[8]  Lisa Higham,et al.  Self-Stabilizing Token Circulation on Anonymous Message Passing Rings (Extended Abstract) , 1998 .

[9]  Mahdi Zargarnataj New Election Algorithm based on Assistant in Distributed Systems , 2007, 2007 IEEE/ACS International Conference on Computer Systems and Applications.

[10]  Yehuda Afek,et al.  Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks , 1991, SIAM J. Comput..

[11]  Nancy A. Lynch,et al.  The impact of synchronous communication on the problem of electing a leader in a ring , 1984, STOC '84.

[12]  Ernest J. H. Chang,et al.  An improved algorithm for decentralized extrema-finding in circular configurations of processes , 1979, CACM.

[13]  Hector Garcia-Molina,et al.  Elections in a Distributed Computing System , 1982, IEEE Transactions on Computers.

[14]  M. Gholipour,et al.  A New Approach for Election Algorithm in Distributed Systems , 2009, 2009 Second International Conference on Communication Theory, Reliability, and Quality of Service.

[15]  Shing-Tsaan Huang,et al.  Leader election in uniform rings , 1993, TOPL.

[16]  Mehdi Dehghan,et al.  Determining a Central Controlling Processor with Fault Tolerant Method in Distributed System , 2007, Fourth International Conference on Information Technology (ITNG'07).

[17]  Atef A. Obeidat,et al.  Leader election in Peer-to-Peer systems , 2009, 2009 International Siberian Conference on Control and Communications.

[18]  Faith Ellen,et al.  A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings , 2001, DISC.

[19]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[20]  Nitin H. Vaidya,et al.  Leader election algorithms for mobile ad hoc networks , 2000, DIALM '00.

[21]  Lisa Higham,et al.  SelfStabilizing Token Circulation on Anonymous Message Passing , 1998, OPODIS.

[22]  M. Shirali,et al.  Leader Election Algorithms: History and Novel Schemes , 2008, 2008 Third International Conference on Convergence and Hybrid Information Technology.