Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/efficient-agreement-using-fault-diagnosis-1w4STjrZyR
References (22)
-
M. Pease, R. Shostak, L. Lamport (1980)
Reaching Agreement in the Presence of FaultsJ. ACM, 27
-
R. Reischuk (1985)
A New Solution for the Byzantine Generals ProblemInf. Control., 64
-
D. Dolev (1981)
The Byzantine Generals Strike AgainJ. Algorithms, 3
-
P. Berman, J. Garay (1993)
Cloture Votes:n/4-resilient Distributed Consensus int + 1 roundsMathematical systems theory, 26
-
B. Coan, J. Welch (1993)
Modular construction of an efficient 1-bit Byzantine agreement protocolMathematical systems theory, 26
-
P. Berman, J. Garay, K. Perry (1989)
Towards optimal distributed consensus30th Annual Symposium on Foundations of Computer Science
-
T. Srikanth, S. Toueg (1987)
Simulating authenticated broadcasts to derive simple fault-tolerant algorithmsDistributed Computing, 2
-
D. Dolev, R. Reischuk (1985)
Bounds on information exchange for Byzantine agreementJ. ACM, 32
-
M. Fischer, N. Lynch (1982)
A Lower Bound for the Time to Assure Interactive ConsistencyInf. Process. Lett., 14
-
J. Garay, Y. Moses (1993)
Fully polynomial Byzantine agreement in t + 1 roundsProceedings of the twenty-fifth annual ACM symposium on Theory of Computing
-
(1992)
Fast and simple Byzantine agreement. Tech Rep 92/12 -
M. Fischer, N. Lynch, Michael Merritt (1985)
Easy impossibility proofs for distributed consensus problemsDistributed Computing, 1
-
D. Dolev, M. Fischer, R. Fowler, N. Lynch, H. Strong (1982)
An Efficient Algorithm for Byzantine Agreement without AuthenticationInf. Control., 52
-
A. Bar-Noy, D. Dolev (1991)
Consensus algorithms with one-bit messagesDistributed Computing, 4
-
Y. Moses, Orli Waarts (1988)
Coordinated traversal: (t+1)-round Byzantine agreement in polynomial time[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
-
S. Toueg, K. Perry, T. Srikanth (1987)
Fast Distributed AgreementSIAM J. Comput., 16
-
L. Lamport, R. Shostak, M. Pease (1982)
The Byzantine Generals ProblemACM Trans. Program. Lang. Syst., 4
-
B. Coan (1986)
A communication-efficient canonical form for fault-tolerant distributed protocols -
B. Coan, J. Welch (1992)
Modular Construction of a Byzantine Agreement Protocol with Optimal Message Bit ComplexityInf. Comput., 97
-
D. Dolev, R. Reischuk, H. Strong (1990)
Early stopping in Byzantine agreementJ. ACM, 37
-
A. Bar-Noy, Danny Dolev, C. Dwork, H. Strong (1987)
Shifting gears: changing algorithms on the fly to expedite Byzantine agreement -
V. Hadzilacos (1987)
Connectivity requirements for Byzantine agreement under restricted types of failuresDistributed Computing, 2
- Publisher
- Springer Journals
- Copyright
- Copyright © 1993 by Springer-Verlag
- Subject
- Computer Science; Computer Communication Networks; Computer Hardware; Computer Systems Organization and Communication Networks; Software Engineering/Programming and Operating Systems; Theory of Computation
- ISSN
- 0178-2770
- eISSN
- 1432-0452
- DOI
- 10.1007/BF02280838
- Publisher site
- See Article on Publisher Site
Abstract
We give an extremely simple Byzantine agreement protocol that usesO(t 2) processors, min(f+2,t+1) rounds of communication,O(n·t·f·log|V|) total message bits, andO(log|V|) maximum message size, wheren is the total number of processors that actually participate in the protocol,t is an upper bound on the number of faulty processors,f is the number of processors that actually fail in a given execution, andV is the set of possible inputs. This protocol uses roughly the same resources as a more complex protocol due to Dolev, Reischuk, and Strong. By adding explicit fault diagnosis to our first protocol, we produce a some-what more complicated protocol that usesO(t 1.5) processors, min(f+2,t+1) rounds,O(n·t 2 ·f·log|V|) total message bits, andO(t·log|V|) maximum message size.
Journal
Distributed Computing – Springer Journals
Published: Nov 27, 2005