Skip to main content
SpringerLink
Log in

Approximate agreement with mixed mode faults: Algorithm and lower bound

  • Contributed Papers
  • Conference paper
  • First Online:
Distributed Computing (DISC 1998)

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

Included in the following conference series:

Abstract

Approximate agreement is a building block for fault-tolerant distributed systems. It is a formalisation for the basic operation of choosing a single real value (representing say speed) for use in later computation, reflecting the different approximations to this value reported from a number of possibly-faulty processors or sensors. We study the approximate agreement problem in distributed systems where processor failures are characterised depending on their severity. We develope a new algorithm that can tolerate up to b byzantine faults, s symmetric ones, and o send-omission faults. We analyse the convergence attained by this algorithm, and also give a universal bound on the convergence available to any algorithm no matter how complicated.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Azadmanesh, R. Kieckhafer, “New Hybrid Fault Models for Asynchronous Approximate Agreement” IEEE Trans on Computers, 45(4):439–449, (1996).

    Article  MATH  Google Scholar 

  2. D. Dolev, N. Lynch, S. Pinter, E. Stark, W. Weihl, “Reaching Approximate Agreement in the Presence of Faults”, Journal of the ACM, 33(3):499–516, (1986).

    Article  MathSciNet  Google Scholar 

  3. C. Dwork, Y. Moses, “Knowledge and Common Knowledge in a Byzantine Environment: Crash Failures”, Information and Computation, 88(2):156–186, (1990).

    Article  MATH  MathSciNet  Google Scholar 

  4. A. Fekete, “Asymptotically Optimal Algorithms for Approximate Agreement”, Distributed Computing, 4:9–29, (1990).

    Article  MathSciNet  Google Scholar 

  5. A. Fekete, “Asynchronous Approximate Agreement” Information and Computation 115(1):95–124, (1994).

    Article  MATH  MathSciNet  Google Scholar 

  6. M. Fischer, N. Lynch, “A Lower Bound for the Time to Assure Interactive Consistency”, Information Processing Letters 14(4):183–186 (1982).

    Article  MATH  MathSciNet  Google Scholar 

  7. M. Fischer, N. Lynch, M. Patterson, “Impossibility of Distributed Consensus with One Faulty Process”, Journal of the ACM, 32(2):374–382 (1985).

    Article  MATH  Google Scholar 

  8. R. Kieckhafer, M. Azadmanesh, “Reaching Approximate Agreement with Mixed-Mode Faults”, IEEE Trans on Parallel and Distributed Systems, 5(1):53–63, (1994).

    Article  MathSciNet  Google Scholar 

  9. M. Pease, R. Shostak, L. Lamport, “Reaching Agreement in the Presence of Faults”, Journal of the ACM 27(2):228–234 (1980).

    Article  MATH  MathSciNet  Google Scholar 

  10. P. Thambidurai, Y. Park, “Interactive Consistency with Multiple Faiilure Modes”, in Proc 7th IEEE Symposium on Reliable Distributed Systems, (1988).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Sydney, Australia

    Richard Plunkett & Alan Fekete

Authors
  1. Richard Plunkett
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alan Fekete
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Shay Kutten

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Plunkett, R., Fekete, A. (1998). Approximate agreement with mixed mode faults: Algorithm and lower bound. In: Kutten, S. (eds) Distributed Computing. DISC 1998. Lecture Notes in Computer Science, vol 1499. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056493

Download citation

  • DOI: https://doi.org/10.1007/BFb0056493

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65066-9

  • Online ISBN: 978-3-540-49693-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation