Skip to main content

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

  • Conference paper
  • First Online:
  • 848 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9663))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Hunt, P., Konar, M., Junqueira, F.P., Reed, B.: ZooKeeper: waitfree coordination for internet-scale systems. In: USENIX Annual Technical Conference, vol. 8, p. 9 (2010)

    Google Scholar 

  2. Kreps, J., Narkhede, N., Rao, J., et al.: Kafka: a distributed messaging system for log processing. In: NetDB (2011)

    Google Scholar 

  3. Ranjan, R.: Streaming big data processing in datacenter clouds. IEEE Cloud Comput. 1, 78–83 (2014)

    Article  Google Scholar 

  4. Junqueira, F.P., Reed, B.C., Serafini, M.: Zab: high-performance broadcast for primary-backup systems. In: 2011 IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN), pp. 245–256. IEEE (2011)

    Google Scholar 

  5. Gilbert, S., Lynch, N.: Brewer’s conjecture and the feasibility of consistent, available, partition-tolerant web services. ACM SIGACT News 33(2), 51–59 (2002)

    Article  Google Scholar 

  6. Gilbert, S., Lynch, N.A.: Perspectives on the CAP theorem. Institute of Electrical and Electronics Engineers (2012)

    Google Scholar 

  7. Vogels, W.: Eventually consistent. Commun. ACM 52(1), 40–44 (2009)

    Article  Google Scholar 

  8. Garcia-Molina, H.: Elections in a distributed computing system. IEEE Trans. Comput. 100(1), 48–59 (1982)

    Article  Google Scholar 

  9. Huang, S.T.: Leader election in uniform rings. ACM Trans. Program. Lang. Syst. (TOPLAS) 15(3), 563–573 (1993)

    Article  Google Scholar 

  10. EffatParvar, M., Yazdani, N., EffatParvar, M., Dadlani, A., Khonsari, A.: Improved algorithms for leader election in distributed systems. In: 2010 2nd International Conference on Computer Engineering and Technology (ICCET), vol. 2, pp. V2–6. IEEE (2010)

    Google Scholar 

  11. Ongaro, D., Ousterhout, J.: In search of an understandable consensus algorithm. In: 2014 USENIX Annual Technical Conference (USENIX ATC 14), pp. 305–319 (2014)

    Google Scholar 

  12. Kasheff, Z., Walsh, L.: Ark: a real-world consensus implementation. arXiv preprint arXiv:1407.4765 (2014)

  13. Fetzer, C., Cristian, F.: A highly available local leader election service. IEEE Trans. Softw. Eng. 25(5), 603 (1999)

    Article  Google Scholar 

  14. Malpani, N., Welch, J.L., Vaidya, N.: Leader election algorithms for mobile ad hoc networks. In: Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 96–103. ACM (2000)

    Google Scholar 

  15. Vasudevan, S., Kurose, J., Towsley, D.: Design and analysis of a leader election algorithm for mobile ad hoc networks. In: Proceedings of the 12th IEEE International Conference on Network Protocols, 2004, ICNP 2004, pp. 350–360. IEEE (2004)

    Google Scholar 

  16. Singh, G.: Leader election in the presence of link failures. IEEE Trans. Parallel Distrib. Syst. 3, 231–236 (1996)

    Article  Google Scholar 

  17. Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Stable leader election. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 108–122. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  18. Lamport, L.: Fast paxos. Distrib. Comput. 19(2), 79–103 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  19. Shraer, A., Reed, B., Malkhi, D., Junqueira, F.P.: Dynamic reconfiguration of primary/backup clusters. In: Presented as Part of the 2012 USENIX Annual Technical Conference (USENIX ATC 12), pp. 425–437 (2012)

    Google Scholar 

  20. Ferguson, A., Liang, C.: ZooKeeper-benchmark (2012). https://github.com/brownsys/zookeeper-benchmark

Download references

Acknowledgments

This work is supported by 973 project 2011CB302301, the National Basic Research 973 Program of China under Grant by National University’s Special Research Fee (2015XJGH010).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhipeng Tan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Zhang, X., Tan, Z., Li, M., Zheng, Y., Zhou, W. (2016). ZooKeeper+: The Optimization of Election Algorithm in Complex Network Circumstance. In: Huang, X., Xiang, Y., Li, KC. (eds) Green, Pervasive, and Cloud Computing. Lecture Notes in Computer Science(), vol 9663. Springer, Cham. https://doi.org/10.1007/978-3-319-39077-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-39077-2_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-39076-5

  • Online ISBN: 978-3-319-39077-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics