Abstract
Over the years, the Byzantine Generals Problem has become notorious for the complexity of its solutions. This is particularly true for protocols with the early-stopping property. Moreover, minor changes in the fault model resulted in drastically different protocols. In this paper, we expose a fundamental technique that underlies most of these protocols. We then derive a simple, intuitive, failure-model-independent scheme for solving the Byzantine Generals Problem. The derivation reveals when it is possible to stop early. Using this result, we extend the basic framework into one that yields simple, early-stopping protocols for the Eventual Byzantine Agreement problem. We demonstrate the utility of our results by deriving an early-stopping protocol.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bracha, G., “An (n − 1)/3-Resilient Consensus Protocol”. Proc. of the Third ACM Symposium on Principles of Distributed Computing, 1984.
Cristian, F., Aghili, H., Strong, H.R., and Dolev, D., Atomic Broadcasts: From Simple Message Diffusion to Byzantine Agreement. IBM Research Report RJ4540, December 1984.
Dolev, D., “The Byzantine Generals Strike Again”. Journal of Algorithms, vol. 3, no. 1 (1982).
Dolev, D. and Strong, H.R., “Authenticated Algorithms for Byzantine Agreement”. SIAM Journal of Computing,, vol. 12, no. 4 (November 1983), pp. 656–665.
Dwork, C. and Moses, Y., “Knowledge and Common Knowledge in a Byzantine Environment I: Crash Failures”. Theoretical Aspects of Reasoning About Knowledge, J. Halpern, editor, Morgan Kaufmann Publishing, Los Altos, California, 1986.
Fischer, M. and Lynch, N., “A Lower Bound for the Time to Assure Interactive Consistency”. Information Processing Letters, vol. 14., no. 4 (1982).
Hadzilacos, V., Byzantine Agreement Under Restricted Types of Failures (Not Telling the Truth is Different from Telling Lies). Computer Science Technical Report TR-18-63, Harvard University, 1983.
Lamport, L. and Fischer, M., Byzantine Generals and Transaction Commit Protocols. SRI International Opus 62, April 1982.
Lamport, L., Shostak, R., and Pease, M., “The Byzantine Generals Problem”. ACM Trans. on Programming Languages and Systems, vol. 4, no. 3 (July 1982).
Perry, K., Early Stopping Protocols for Fault-Tolerant Distributed Agreement. Doctoral Dissertation, Dept. of Computer Science Technical Report TR-662, Cornell University, February 1985.
Perry, K. and Toueg, S., An Authenticated Byzantine Generals Algorithm with Early Stopping. Dept. of Computer Science Technical Report TR-623, Cornell University, July 1984.
Perry, K. and Toueg, S., “Distributed Agreement in the Presence of Processor and Communication Faults”. IEEE Transactions on Software Engineering, vol. SE-12, no. 3 (March 1986).
Srikanth, T.K. and Toueg, S., Byzantine Agreement Made Simple: Simulating Authentication Without Signatures. Dept. of Computer Science Technical Report TR-623, Cornell University, July 1984.
Toueg, S., Perry, K., and Srikanth, T.K., “Fast Distributed Agreement”. Proc. of the Fourth ACM Symposium on Principles of Distributed Computing, Minaki, Canada, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Perry, K.J. (1988). A framework for agreement. In: van Leeuwen, J. (eds) Distributed Algorithms. WDAG 1987. Lecture Notes in Computer Science, vol 312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019794
Download citation
DOI: https://doi.org/10.1007/BFb0019794
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