ZooKeeper+: The Optimization of Election Algorithm in Complex Network Circumstance

Dynamic configuration management brings challenge for the distributed file systems while keeping the normal service. In this paper, we describe a robust election algorithm based on ZooKeeper, we realize the dynamic addition and deletion of servers without service interruption. There is only one clustered mode for servers without switching between prior two modes, it also speeds up the leader election. The leader maintains an active server list which speeds up handling of the transaction. The algorithm also ensures the data consistency and system stability against all possible issues. Through the evaluation, it takes not much overhead to realize the addition and deletion of servers and the recovery of crashed servers under various complex network circumstances, and it takes little more election time and initialization time of service to obtain the greater scalability.

[1]  Nasser Yazdani,et al.  Improved algorithms for leader election in distributed systems , 2010, 2010 2nd International Conference on Computer Engineering and Technology.

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

[3]  Flaviu Cristian,et al.  A Highly Available Local Leader Election Service , 1999, IEEE Trans. Software Eng..

[4]  Rajiv Ranjan,et al.  Streaming Big Data Processing in Datacenter Clouds , 2014, IEEE Cloud Computing.

[5]  John K. Ousterhout,et al.  In Search of an Understandable Consensus Algorithm , 2014, USENIX ATC.

[6]  Nancy A. Lynch,et al.  Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services , 2002, SIGA.

[7]  Donald F. Towsley,et al.  Design and analysis of a leader election algorithm for mobile ad hoc networks , 2004, Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004..

[8]  Werner Vogels,et al.  Building reliable distributed systems at a worldwide scale demands trade-offs between consistency and availability. , 2022 .

[9]  Leslie Lamport,et al.  Fast Paxos , 2006, Distributed Computing.

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

[11]  Marcos K. Aguilera,et al.  Stable Leader Election , 2001, DISC.

[12]  Nancy A. Lynch,et al.  Perspectives on the CAP Theorem , 2012, Computer.

[13]  Leif Walsh,et al.  Ark: A Real-World Consensus Implementation , 2014, ArXiv.

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

[15]  Alexander Shraer,et al.  Dynamic Reconfiguration of Primary/Backup Clusters , 2012, USENIX Annual Technical Conference.

[16]  Flavio Paiva Junqueira,et al.  Zab: High-performance broadcast for primary-backup systems , 2011, 2011 IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN).

[17]  Gurdip Singh,et al.  Leader Election in the Presence of Link Failures , 1996, IEEE Trans. Parallel Distributed Syst..