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.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
Y. Nishitani and N. Honda, The firing squad synchronization problem for graphs, Theoretical Computer Science 14(1981), 39–61.
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.
E.T. Ordman, A byzantine firing squad algorithm for networks, Technical report, Memphis State University Dept. of Mathematical Sciences, 1987.
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.
Author information
Authors and Affiliations
Editor information
Rights 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