Shifting gears: changing algorithms on the fly to expedite Byzantine agreement

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Shifting gears: changing algorithms on the fly to expedite Byzantine agreement

Full text

Pdf (1.00 MB)

Source

Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the sixth annual ACM Symposium on Principles of distributed computing table of contents

Vancouver, British Columbia, Canada

Pages: 42 - 51

Year of Publication: 1987

ISBN:0-89791-239-4

Authors

Amotz Bar-Noy	Hebrew University
Danny Dolev	Hebrew University
Cynthia Dwork	IBM Almaden Research Center
H. Raymond Strong	IBM Almaden Research Center

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGOPS: ACM Special Interest Group on Operating Systems

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 19, Citation Count: 15

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/41840.41844 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	C1	Brian A Coan, A communication-efficient canonical form for fault-tolerant distributed protocols, Proceedings of the fifth annual ACM symposium on Principles of distributed computing, p.63-72, August 11-13, 1986, Calgary, Alberta, Canada [doi>10.1145/10590.10596]
	C2	Count, B.A,, PhD The,ia, MIT (in preparation).
	DRS	Dolev, D., Rcischuk, R., and Strong, H.R., "Early Stopping in Byzantine Agreement," IBM Research Report RJ5406 (55357), 1986.
	DS	Danny Dolev , H. Raymond Strong, Polynomial algorithms for multiple processor agreement, Proceedings of the fourteenth annual ACM symposium on Theory of computing, p.401-407, May 05-07, 1982, San Francisco, California, United States [doi>10.1145/800070.802215]
	FL	Fischer, M. and Lynch, N., "A Lower Bound for the Time to Assltre lalteractive Consistency", In}ormarion Processing Letters, 14(4) (t982), pp. 183- 186.
	PSL	M. Pease , R. Shostak , L. Lamport, Reaching Agreement in the Presence of Faults, Journal of the ACM (JACM), v.27 n.2, p.228-234, April 1980 [doi>10.1145/322186.322188]

CITED BY 15

	Mattias Fitzi , Ueli Maurer, From partial consistency to global broadcast, Proceedings of the thirty-second annual ACM symposium on Theory of computing, p.494-503, May 21-23, 2000, Portland, Oregon, United States
	S. C. Wang , Y. H. Chin , K. Q. Yan, Byzantine Agreement in a Generalized Connected Network, IEEE Transactions on Parallel and Distributed Systems, v.6 n.4, p.420-427, April 1995
	Juan A. Garay , Yoram Moses, Fully polynomial Byzantine agreement in t + 1 rounds, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.31-41, May 16-18, 1993, San Diego, California, United States
	B. A. Coan , J. L. Welch, Modular construction of nearly optimal Byzantine agreement protocols, Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, p.295-305, June 1989, Edmonton, Alberta, Canada
	K. -Q. Yan , Y. H. Chin , S. -C. Wang, Optimal Agreement Protocol in Malicious Faulty Processors and Faulty Links, IEEE Transactions on Knowledge and Data Engineering, v.4 n.3, p.266-280, June 1992
	Matthias Fitzi , Juan A. Garay, Efficient player-optimal protocols for strong and differential consensus, Proceedings of the twenty-second annual symposium on Principles of distributed computing, p.211-220, July 13-16, 2003, Boston, Massachusetts
	Bernadette Charron-Bost , André Schiper, Uniform consensus is harder than consensus, Journal of Algorithms, v.51 n.1, p.15-37, 1 April 2004
	Ajei S. Gopal , Kenneth J. Perry, Unifying self-stabilization and fault-tolerance, Proceedings of the twelfth annual ACM symposium on Principles of distributed computing, p.195-206, August 15-18, 1993, Ithaca, New York, United States
	S. C. Wang , K. Q. Yan, Revisiting fault diagnosis agreement in a new territory, ACM SIGOPS Operating Systems Review, v.38 n.2, p.41-61, April 2004
	Hin-Sing Siu , Yeh-Hao Chin , W.-P. Yang, Byzantine Agreement in the Presence of Mixed Faults on Processors and Links, IEEE Transactions on Parallel and Distributed Systems, v.9 n.4, p.335-345, April 1998
	Kuo-Qin Yan , Shu-Ching Wang, Reaching fault diagnosis agreement on an unreliable general network, Information Sciences—Informatics and Computer Science: An International Journal, v.170 n.2-4, p.397-407, 25 February 2005
	Arkady Zamsky , Amos Israeli , Shlomit S. Pinter, Optimal time Byzantine agreement for t < n/8 with linear-messages, Distributed Computing, v.9 n.2, p.95-108, October 1995
	Shu-Ching Wang , Chieng-Fu Cheng, Eventually Dual Failure Agreement, Fundamenta Informaticae, v.57 n.1, p.79-99, January 2003
	K. Q. Yan , S. C. Wang , G. Y. Zheng, Dual agreement virtual subnet protocol for mobile ad-hoc networks, Proceedings of the 2007 ACM symposium on Applied computing, March 11-15, 2007, Seoul, Korea
	Hui-Ching Hsieh , Jenq-Shiou Leu , Yen-Chiu Chen , Wei-Kuan Shih, Improving fault-tolerant scheme for a time-sensitive autonomous local wireless sensor network, Proceedings of the International Conference on Mobile Technology, Applications, and Systems, September 10-12, 2008, Yilan, Taiwan