Skip to main content
SpringerLink
Log in

Byzantine firing squad using a faulty external source

  • Conference paper
  • First Online:
Book cover Distributed Algorithms (WDAG 1987)

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

Included in the following conference series:

  • 158 Accesses

Abstract

Burns and Lynch have given a general algorithm for initial synchronization of clocks in a computer network, running synchronously, where a limited number of processors are allowed to have byzantine faults, that is, fail arbitrarily. They effectively run a byzantine agreement algorithm for each process in the network. Here we show that only one byzantine agreement algorithm is necessary, if we treat the outside signal source as an additional potentially faulty process.

Partially supported by U.S. National Science Foundation grant number DCR-8503922.

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. J.E. Burns and N.A. Lynch, The byzantine firing squad problem, MIT Laboratory for Computer Science report TM-275, April 1985; to appear in Advances in Computing Research.

    Google Scholar 

  2. M.J. Fischer, N.A. Lynch and M. Merritt, Easy impossibility proofs for distributed consensus problems, Proc. 4th ACM Symp. on Principles of Distributed Computing, Minaki, Canada, August, 1985, 59–70.

    Google Scholar 

  3. Y. Nishitani and N. Honda, The firing squad synchronization problem for graphs, Theoretical Computer Science 14(1981), 39–61.

    Article  Google Scholar 

  4. E.T. Ordman, Distributed graph recognition with malicious faults, to appear in Proceedings First China-U.S.A. International Conf. on Graph Theory and its Applications, Jinan, China, June, 1986.

    Google Scholar 

  5. E.T. Ordman, A byzantine firing squad algorithm for networks, Technical report, Memphis State University Dept. of Mathematical Sciences, 1987.

    Google Scholar 

  6. S. Toueg, K.J. Perry and T.K. Srikanth, Fast distributed agreement, Proc. 4th ACM Symposium on Principles of Distributed Computing, Minaki, Canada, August, 1985, 87–101.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Memphis State University, 38152, Memphis, TN, USA

    Edward T. Ordman

Authors
  1. Edward T. Ordman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ordman, E.T. (1988). Byzantine firing squad using a faulty external source. In: van Leeuwen, J. (eds) Distributed Algorithms. WDAG 1987. Lecture Notes in Computer Science, vol 312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019795

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19366-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation