Skip to main content

Muteness Failure Detectors: Specification and Implementation

  • Conference paper
  • First Online:
Dependable Computing — EDCC-3 (EDCC 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1667))

Included in the following conference series:

Abstract

This paper extends the failures detector approach from crash-stop failures to muteness failures. Muteness failures are malicious failures in which a process stops sending algorithm messages, but might continue to send other messages, e.g., “I-am-alive” messages. The paper presents both the specification of a muteness failure detector, denoted by

$$ \diamondsuit {\rm M}_{\mathcal{A},} $$

, and an implementation of

$$ \diamondsuit {\rm M}_{\mathcal{A},} $$

in a partial synchrony model (there are bounds on message latency and clock skew, but these bounds are unknown and hold only after some point that is itself unknown). We show that, modulo a simple modification, a consensus algorithm that has been designed in a crash-stop model with

$$ \diamondsuit S $$

, can be reused in the presence of muteness failures simply by replacing

$$ \diamondsuit {\rm M}_{\mathcal{A},} $$

with

$$ \diamondsuit S $$

.

Research supported by OFES under contract number 95.0830, as part of the ESPRIT BROADCAST-WG (number 22455).

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

Access this chapter

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. M. Aguilera, W. Chen, and S. Toueg. Failure detection and consensus in the crash-recovery model. In 12th International Symposium on Distributed Computing. Springer Verlag, LNCS 1499, September 1998.

    Google Scholar 

  2. G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the Association for Computing Machinery, 32(4):824–840, October 1985.

    MathSciNet  Google Scholar 

  3. T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225–267, March 1996.

    Article  MATH  MathSciNet  Google Scholar 

  4. Danny Dolev, Roy Friedman, Idit Keidar, and Dahlia Malkhi. Failure detectors in omission failure environments. In Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, page 286, Santa Barbara, California, August 1997.

    Google Scholar 

  5. A. Doudou and S. Schiper. Muteness detectors for consensus with byzantine processes (brief announcement). In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing (PODC’98), Puerto Vallarta, Mexico, June 1998. ACM. An extended version of this brief annoucement is available as a Technical Report, TR 97/230, EPFL, Detp d’Informatique, October 1997, under the title “Muteness Failure Detector for Consensus with Byzantine Processes”.

    Google Scholar 

  6. C. Dwork, N. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM, 35(2):288–323, apr 1988.

    Article  MathSciNet  Google Scholar 

  7. M. Fischer, N. Lynch, and M. Paterson. Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM, 32:374–382, April 1985.

    Article  MATH  MathSciNet  Google Scholar 

  8. R. Guerraoui and A. Schiper. Consensus service: a modular approach for building agreement protocols in distributed systems. In IEEE 26th Int Symp on Fault-Tolerant Computing (FTCS-26), pages 168–177, June 1996.

    Google Scholar 

  9. Rachid Guerraoui. Revisiting the relationship between non-blocking atomic commitment and consensus. In Jean-Michel Hélary and Michel Raynal, editors, Distributed Algorithms, 9th International Workshop, WDAG’ 95, volume 972 of Lecture Notes in Computer Science, pages 87–100, Le Mont-Saint-Michel, France, 13-15 September 1995. Springer.

    Chapter  Google Scholar 

  10. Kim Potter Kihlstrom, Louise E. Moser, and P. M. Melliar-Smith. Solving consensus in a Byzantine environment using an unreliable fault detector. In Proceedings of the International Conference on Principles of Distributed Systems (OPODIS), pages 61-75, December 1997.

    Google Scholar 

  11. L. Lamport, R. Shostak, and M. Pease. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems, 4(3):382–401, July 1982.

    Article  MATH  Google Scholar 

  12. D. Malkhi and M. Reiter. Unreliable Intrusion Detection in Distributed Computations. In Proc. 10th Computer Security Foundations Workshop (CSFW97), pages 116–124, June 1997.

    Google Scholar 

  13. O. Babaoğlu, R. Davoli, and A. Montresor. Failure Detectors, Group Membership and View-Synchronous Communication in Partitionable Asynchronous Systems. Technical Report UBLCS-95-18, Department of Computer Science University of Bologna, November 1995.

    Google Scholar 

  14. R. Oliveira, R. Guerraoui, and A. Schiper. Consensus in the crash-recover model. Technical Report 97/239, École Polytechnique Fédérale de Lausanne, Switzerland, August 1997.

    Google Scholar 

  15. A. Schiper. Early consensus in an asynchronous system with a weak failure detector. Distributed Computing, 10(3):149–157, April 1997.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Doudou, A., Garbinato, B., Guerraoui, R., Schiper, A. (1999). Muteness Failure Detectors: Specification and Implementation. In: Hlavička, J., Maehle, E., Pataricza, A. (eds) Dependable Computing — EDCC-3. EDCC 1999. Lecture Notes in Computer Science, vol 1667. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48254-7_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-48254-7_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66483-3

  • Online ISBN: 978-3-540-48254-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics