Skip to main content
SpringerLink
Log in

Brief Announcement: Anonymity, Failures, Detectors and Consensus

  • Conference paper
Distributed Computing (DISC 2012)

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

Included in the following conference series:

Abstract

The paper determines the weakest failure detector for consensus in asynchronous, crash prone and anonymous message passing systems.

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

References

  1. Bonnet, F., Raynal, M.: Anonymous Asynchronous Systems: The Case of Failure Detectors. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 206–220. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  2. Bonnet, F., Raynal, M.: Consensus in anonymous distributed systems: Is there a weakest failure detector? In: AINA 2010, pp. 206–213. IEEE (2010)

    Google Scholar 

  3. Bouzid, Z., Travers, C.: Anonymity, failures, detectors and consensus. Technical report, http://hal.inria.fr/hal-00723309

  4. Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. J. ACM 43(4), 685–722 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. ACM 43(2), 225–267 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  6. Delporte-Gallet, C., Fauconnier, H., Guerraouip, R.: Tight failure detection bounds on atomic object implementations. J. ACM 57(4) (2010)

    Google Scholar 

  7. Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374–382 (1985)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University Pierre et Marie Curie - Paris 6, LIP6, France

    Zohir Bouzid

  2. University Bordeaux 1, LaBRI, France

    Corentin Travers

Authors
  1. Zohir Bouzid
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Corentin Travers
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microsoft Corporation, Building SVC6, 1065 La Avenida, 94043, Mountain View, CA, USA

    Marcos K. Aguilera

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bouzid, Z., Travers, C. (2012). Brief Announcement: Anonymity, Failures, Detectors and Consensus. In: Aguilera, M.K. (eds) Distributed Computing. DISC 2012. Lecture Notes in Computer Science, vol 7611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33651-5_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33651-5_41

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33650-8

  • Online ISBN: 978-3-642-33651-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation