Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Distributed Algorithms

WDAG 1995: Distributed Algorithms pp 242–256Cite as

Total ordering algorithms for asynchronous Byzantine systems

  • Conference paper
  • First Online:

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

Abstract

The Total algorithms are used within asynchronous faulttolerant distributed systems to derive a total order on messages from a causal order provided by an underlying multicast communication protocol. We present several Total algorithms that represent varying compromises between latency to message ordering and resilience to crash and Byzantine faults. The algorithms use a multi-stage voting strategy to achieve agreement on the total order, and depend on the random structure of the causal order to achieve probabilistic termination.

This work was supported by the Advanced Research Project Agency, Grant No. N00174-93-K-0097.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Bar-Noy, X. Deng, J. A. Garay and T. Kameda, “Optimal amortized distributed consensus,” Proceedings of the 5th International Workshop on Distributed Algorithms, Delphi, Greece, October 1991, Lecture Notes in Computer Science 579, Springer Verlag, pp. 95–107.

    Google Scholar 

  2. A. Bar-Noy and D. Dolev, “Consensus algorithms with one-bit messages,” Distributed Computing, vol. 4, 1991, pp. 105–110.

    Article  Google Scholar 

  3. R. Bazzi and G. Neiger, “Simulating crash failures with many faulty processors,” Proceedings of the 6th International Workshop on Distributed Algorithms, Haifa, Israel, November 1992, Lecture Notes in Computer Science 647, Springer Verlag, pp. 166–184.

    Google Scholar 

  4. M. Ben-Or, “Another advantage of free choice: Completely asynchronous agreement protocols,” Proceedings of the 2nd Annual ACM Symposium on Principles of Distributed Computing, Montreal, Quebec, Cananda, August 1983, pp. 27–30.

    Google Scholar 

  5. G. Bracha, “Asynchronous Byzantine agreement protocols,” Information and Computation, vol. 75, no. 2, November 1987, pp. 130–143.

    Article  Google Scholar 

  6. G. Bracha and S. Toueg, “Asynchronous consensus and broadcast protocols,” Journal of the ACM, vol. 31, no. 4, October 1985, pp. 824–840.

    Article  Google Scholar 

  7. T. D. Chandra and S. Toueg, “Unreliable failure detectors for asynchronous systems,” Proceedings of the Tenth ACM Symposium on Principles of Distributed Computing, Montreal, Quebec, Canada, August 1991, pp. 325–340.

    Google Scholar 

  8. T. D. Chandra, V. Hadzilacos and S. Toueg, “The weakest failure detector for solving consensus,” Proceedings of the Eleventh ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, August 1992, pp. 147–158.

    Google Scholar 

  9. M. J. Fischer, N. A. Lynch and M. S. Paterson, “Impossibility of distributed consensus with one faulty process,” Journal of the ACM, vol. 32, no. 2, April 1985, pp. 374–382.

    Article  Google Scholar 

  10. J. A. Garay and K. J. Perry, “A continuum of failure models for distributed computing,” Proceedings of the 6th International Workshop on Distributed Algorithms, Haifa, Israel, November 1992, Lecture Notes in Computer Science 647, Springer Verlag, pp. 153–165.

    Google Scholar 

  11. A. Gopal and S. Toueg, “Reliable broadcast in synchronous and asynchronous environments,” Proceedings of the 3rd International Workshop on Distributed Algorithms, Nice, France, September 1989, Lecture Notes in Computer Science 392, Springer Verlag, pp. 110–23.

    Google Scholar 

  12. L. Lamport, “Time, clocks, and the ordering of events in a distributed system,” Communications of the ACM, vol. 21, no. 7, July 1978, pp. 558–565.

    Article  Google Scholar 

  13. F. J. Meyer and D. K. Pradhan, “Consensus with dual failure modes,” IEEE Transactions on Parallel and Distributed Systems, vol. 2, no. 2, April 1991, pp. 214–222.

    Article  Google Scholar 

  14. L. E. Moser, P. M. Melliar-Smith and V. Agrawala, “Asynchronous fault-tolerant total ordering algorithms,” SIAM Journal of Computing, vol. 22, no. 4, August 1993, pp. 727–750.

    Article  Google Scholar 

  15. M. Pease, R. E. Shostak and L. Lamport, “Reaching agreement in the presence of faults,” Journal of the ACM, vol. 27, no. 2, 1980, pp. 228–234.

    Article  Google Scholar 

  16. M. O. Rabin, “Randomized Byzantine generals,” Proceedings of the 24th Annual Symposium on Foundations of Computer Science, Tucson, AZ, November 1983, pp. 403–409.

    Google Scholar 

  17. F. B. Schneider, “Byzantine generals in action: Implementing fail-stop processors,” ACM Transactions on Computer Systems, vol. 2, no. 2, May 1984, pp. 145–154.

    Article  Google Scholar 

  18. P. Thambidurai and Y. K. Park, “Interactive consistency with multiple failure modes,” Proceedings of the 7th IEEE Symposium on Reliable Distributed Systems, Columbus, OH, October 1988, pp. 93–100.

    Google Scholar 

  19. S. Toueg, K. J. Perry and T. K. Srikanth, “Fast distributed agreement,” SIAM Journal of Computing, vol. 16, no. 3, June 1987, pp. 445–457.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of California, 93106, Santa Barbara, CA

    Louise E. Moser & P. M. Melliar-Smith

Authors
  1. Louise E. Moser
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. M. Melliar-Smith
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jean-Michel Hélary Michel Raynal

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moser, L.E., Melliar-Smith, P.M. (1995). Total ordering algorithms for asynchronous Byzantine systems. In: Hélary, JM., Raynal, M. (eds) Distributed Algorithms. WDAG 1995. Lecture Notes in Computer Science, vol 972. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022151

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-44783-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation