Skip to main content
SpringerLink
Log in

Fast Leader (Full) Recovery Despite Dynamic Faults

  • Conference paper
Distributed Computing and Networking (ICDCN 2013)

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

Included in the following conference series:

  • 1429 Accesses

Abstract

We give a leader recovery protocol that recovers a legitimate configuration where a single leader exists, after at most k arbitrary memory corruptions hit the system. That is, if a leader is elected before state corruptions, the same leader is elected after recovery. Our protocol works in any anonymous bidirectional, yet oriented, ring of size n, and does not require that processes know n, although the knowledge of k is assumed. If n ≥ 18k + 1, our protocol recovers the leader in \(O(k^{{{\scriptscriptstyle2}}})\) rounds using O(logk) bits per process, assuming unfair scheduling. Our protocol handles dynamic faults in the sense that memory corruption may still occur while the network has started recovering the leader.

See www-verimag.imag.fr/Technical-Reports,264.html?lang=en&number=TR-2012-18 for the full version.

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. Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643–644 (1974)

    Article  MATH  Google Scholar 

  2. Beauquier, J., Genolini, C., Kutten, S.: k-stabilization of reactive tasks. In: PODC, p. 318 (1998)

    Google Scholar 

  3. Burman, J., Herman, T., Kutten, S., Patt-Shamir, B.: Asynchronous and Fully Self-stabilizing Time-Adaptive Majority Consensus. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol. 3974, pp. 146–160. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Kutten, S., Patt-Shamir, B.: Stabilizing time-adaptive protocols. TCS 220(1), 93–111 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  5. Kutten, S., Peleg, D.: Fault-local distributed mending. J. Algorithms 30(1), 144–165 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ghosh, S., Gupta, A., Herman, T., Pemmaraju, S.V.: Fault-containing self-stabilizing distributed protocols. Distributed Computing 20(1), 53–73 (2007)

    Article  Google Scholar 

  7. Ghosh, S., He, X.: Scalable self-stabilization. JPDC 62(5), 945–960 (2002)

    MATH  Google Scholar 

  8. Beauquier, J., Delaët, S., Haddad, S.: Necessary and sufficient conditions for 1-adaptivity. In: IPDPS (April 2006)

    Google Scholar 

  9. Dasgupta, A., Ghosh, S., Xiao, X.: Probabilistic Fault-Containment. In: Masuzawa, T., Tixeuil, S. (eds.) SSS 2007. LNCS, vol. 4838, pp. 189–203. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, UNLV, USA

    Ajoy K. Datta & Lawrence L. Larmore

  2. VERIMAG, Université de Grenoble, France

    Stéphane Devismes

  3. LIP6, UPMC Sorbonne Universités & Inria, France

    Sébastien Tixeuil

Authors
  1. Ajoy K. Datta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stéphane Devismes
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lawrence L. Larmore
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sébastien Tixeuil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IRISA/INRIA-Rennes, Campus Universitaire de Beaulieu, Campus Universitaire de Beaulieu, 35042, Rennes Cedex, France

    Davide Frey

  2. IRISA-ISTIC Université de Rennes 1, Institut Universitaire de France, Campus Universitaire de Beaulieu, 35042, Rennes Cedex, France

    Michel Raynal

  3. Department of Electrical and Systems Engineering, University of Pennsylvania, 200 S. 33rd Street, 19104, Philadelphia, PA, USA

    Saswati Sarkar

  4. Faculty of Technology and Computer Science, Tata Institute of Fundamental Research, Homi Bhabha Road, 400005, Mumbai, India

    Rudrapatna K. Shyamasundar

  5. Department of Computer Science and Engineering, 791 Drees Labs, The Ohio State University, 2015 Neil Avenue, 43210-1277, Columbus, OH, USA

    Prasun Sinha

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Datta, A.K., Devismes, S., Larmore, L.L., Tixeuil, S. (2013). Fast Leader (Full) Recovery Despite Dynamic Faults. In: Frey, D., Raynal, M., Sarkar, S., Shyamasundar, R.K., Sinha, P. (eds) Distributed Computing and Networking. ICDCN 2013. Lecture Notes in Computer Science, vol 7730. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35668-1_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35668-1_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35667-4

  • Online ISBN: 978-3-642-35668-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation