Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Hierarchical Eventual Leader Election for Dynamic Systems

  • Conference paper
Algorithms and Architectures for Parallel Processing (ICA3PP 2014)

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

  • 2598 Accesses

Abstract

Dynamic system is a recent hot research topic in theoretical distributed computing. The dynamicity caused by process join and leave bring new challenges in fundamental distributed computing problems, such as eventual leader election. In this paper, we consider leader election in dynamic systems with cluster-based hierarchy. Clustering based hierarchy has been used in fundamental distributed algorithms to achieve scalability and low communication cost, but, to the best of our knowledge, it is not considered in eventual leader election, especially in eventual leader for dynamic systems. We firstly define new system models to describe the dynamicity of clusters, and then based on these models, we design an algorithm to elect an eventual leader. With cluster hierarchy, leader election is basically conducted in two layers. In the lower layer, cluster-heads are elected with each cluster. Then, in the upper layer, election is conducted among cluster-heads so as to elect the eventual leader of the whole system. Several key challenging issues caused by cluster dynamicity have been addressed in our design, including blocking in election within a cluster and multiple cluster-heads in election of upper layer. The proposed algorithm is proved to be correct rigorously.

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

Access this chapter

Log in via an institution
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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Communication Efficient Leader Election and Consensus with Limited Link Synchrony. In: PODC 2004, pp. 328–337 (2004)

    Google Scholar 

  2. Hutle, M., Malkhi, D., Schmid, U., Zhou, L.: Chasing the Weakest System Model for Implementing Ω and Consensus. IEEE Trans’ on Dependable and Secure Computing 6(4), 269–281 (2009)

    Article  Google Scholar 

  3. Fernández, A., Jiménez, E., Raynal, M.: Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony. In: DSN 2006, pp. 166–175. IEEE Society Press (2006)

    Google Scholar 

  4. Tucci-Piergiovanni, S., Baldoni, R.: Eventual Leader Election in Infinite Arrival Message-Passing System Model with Bounded Concurrency. In: EDCC 2010, pp. 127–134 (2010)

    Google Scholar 

  5. Larrea, M., Raynal, M., Soraluze, I.: Specifying and Implementing an Eventual Leader Service for Dynamic Systems. Int’ J. of Web and Grid Services 8(3), 204–224 (2012)

    Article  Google Scholar 

  6. Kuhn, F., Schmid, S., Wattenhofer, R.: A self-repairing peer-to-peer system resilient to dynamic adversarial churn. In: Castrovan, M., Renesse, R. (eds.) IPTPS 2005. LNCS, vol. 3640, pp. 13–23. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. Rowstron, A., Druschel, P.: Storage Management and Caching in Past, A Large-scale, Persistent Peer-to-peer Storage Utility. ACM SIGOPS Operating Systems Review 35(5), 188–201 (2001)

    Article  Google Scholar 

  8. Vaze, R., Heath, R.W.: Transmission Capacity of Ad-hoc Networks with Multiple Antennas Using Transmit Stream Adaptation and Interference Cancellation. IEEE Transactions on Information Theory 58(2), 780–792 (2012)

    Article  MathSciNet  Google Scholar 

  9. O’Dell, R., Wattenhofer, R.: Information Dissemination in Highly Dynamic Graphs. In: Proc. of the 2005 Joint Workshop on Foundations of Mobile Computing, pp. 104–110. ACM (2005)

    Google Scholar 

  10. Haeupler, B., Karger, D.: Faster Information Dissemination in Dynamic Networks Via Network Coding. In: PODC 2011, pp. 6–8 (2011)

    Google Scholar 

  11. Mostefaoui, A., Raynal, M., Travers, C., et al.: From Static Distributed Systems to Dynamic Systems. In: SRDS 2005, pp. 109–118 (2005)

    Google Scholar 

  12. Merritt, M., Taubenfeld, G.: Computing with Infinitely Many Processes. Distributed Computing. In: Herlihy, M. (ed.) DISC 2000. LNCS, vol. 1914, pp. 164–178. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  13. Chandra, T.D., Toueg, S.: Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM (JACM) 43(2), 225–267 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  14. Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM (JACM) 32(2), 374–382 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  15. Mostefaoui, A., Raynal, M., Travers, C.: Crash-Resilient Time-Free Eventual Leadership. In: SRDS 2004, pp. 208–217. IEEE Computer Society Press (2004)

    Google Scholar 

  16. Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: On Implementing Omega with Weak Reliability and Synchrony Assumptions. Distributed Computing 21(4), 285–314 (2008)

    Article  MATH  Google Scholar 

  17. Gupta, I., Chandra, T.D., Goldszmidt, G.S.: On scalable and efficient distributed failure detectors. In: Proc. 20th ACM Symposium on Principles of Distributed Computing (PODC 2001), pp. 170-179. ACM Press (2001)

    Google Scholar 

  18. Yang, Z., Wu, W., Chen, Y., Zhang, J.: Efficient Information Dissemination in Dynamic Networks. In: ICPP 2013, Lyon, France, October 1-4 (2013)

    Google Scholar 

  19. Mostéfaoui, A., Mourgaya, E., Raynal, M., Travers, C.: A Time-free Assumption to Implement Eventual Leadership. Parallel Processing letters 16(2), 189–208 (2006)

    Article  MathSciNet  Google Scholar 

  20. Malkhi, D., Oprea, F., Zhou, L.: Ω Meets Paxos: Leader Election And Stability without Eventual Timely Links. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 199–213. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  21. Guerraoui, R., Hurfin, M., Mostéfaoui, A., Oliveira, R., Raynal, M., Schiper, A.: Consensus in Asynchronous Distributed Systems: A Concise Guided Tour. In: Krakowiak, S., Shrivastava, S. (eds.) Distributed Systems. LNCS, vol. 1752, pp. 33–47. Springer, Heidelberg (2000)

    Google Scholar 

  22. Raynal, M.: Eventual Leader Service in Unreliable Asynchronous Systems: Why? How? In: NCA 2007, pp. 11–24 (2007)

    Google Scholar 

  23. Wu, W., Cao, J., Yang, J., Raynal, M.: Design and Performance Evaluation of Efficient Consensus Protocols for Mobile Ad Hoc Networks. IEEE Transactions on Computers 56(8), 1055–1070 (2007)

    Article  MathSciNet  Google Scholar 

  24. Wu, W., Cao, J., Raynal, M.: Eventual Clusterer: a Modular Approach to Designing Hierarchical Consensus Protocols in MANETs. IEEE Transactions on Parallel and Distributed Systems 20(6), 753–765 (2009)

    Google Scholar 

  25. Larrea, M., Fernández, A., Arévalo, S.: On the implementation of Unreliable failure detectors in partially synchronous systems. IEEE Transactions on Computers 53(7), 815–828 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Sun Yat-sen University, Guangzhou, 510006, China

    Huaguan Li & Weigang Wu

  2. College of Computer Science, Nanjing University of Aeronautics and Astronautics, Nanjing, 210016, China

    Yu Zhou

Authors
  1. Huaguan Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Weigang Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yu Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Illinois Institute of Technology, 60616-3793, Chicago, IL, USA

    Xian-he Sun

  2. School of Computer Science and Technology, Dalian Maritime University, 1 Linghai Road, 116026, Dalian, China

    Wenyu Qu

  3. University of Ottawa, SEECS, 8, King Edward Ave, K1N 6N5, Ottawa, ON, Canada

    Ivan Stojmenovic

  4. Deakin University, 221 Burwood Highway, 3125, Burwood, VIC, Australia

    Wanlei Zhou

  5. Dalian Maritime University, NO.1 Linhai Road, 116026, Dailian, China

    Zhiyang Li  & Tingting Yang  & 

  6. BeiHang University, XueYuan Road No.37,HaiDian District, Beijing, China

    Hua Guo

  7. University of Bradford, BD7 1DP, Bradford, West Yorkshire, United Kingdom

    Geyong Min

  8. Computer Network Information Center, Chinese Academy of Sciences, 100190, Beijing, China

    Yulei Wu

  9. 27 Shanda Nanlu, 250100, Jinan City, Shandong Province, China

    Lei Liu

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Li, H., Wu, W., Zhou, Y. (2014). Hierarchical Eventual Leader Election for Dynamic Systems. In: Sun, Xh., et al. Algorithms and Architectures for Parallel Processing. ICA3PP 2014. Lecture Notes in Computer Science, vol 8630. Springer, Cham. https://doi.org/10.1007/978-3-319-11197-1_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11197-1_26

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11196-4

  • Online ISBN: 978-3-319-11197-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation