TY - GEN

T1 - Efficient distributed consensus with n=(3 + ∊)t processors

AU - Berman, Piotr

AU - Garay, Juan A.

PY - 1992

Y1 - 1992

N2 - In a Distributed Consensus protocol n processors, of which at most t may be faulty, are given initial binary values; after exchanging messages all the processors that are correct must agree on one of the initial values. We measure the quality of a consensus protocol by the following parameters: the total number of processors n, the number of rounds of message exchange r, and the communication complexity, given by the maximal message size. This paper presents a protocol that achieves Distributed Consensus with n=(3 + ε)t, r=t + 1, and polynomial message size for ε ≥ 1/log t, Thus, this is the first consensus protocol to use simultaneously nearly optimal number of processors (n= 3t + 1 is the known lower bound). optimal number of rounds, and short messages. Previous round-optimal protocols with polynomial communication required n=Ω(t2), n > 6t and n > 4t, respectively. In order to obtain this result, we introduce new techniques for the abbreviation of messages in the classical full information consensus protocol. In particular, we introduce the Dynamic Fault Masking technique, called that way because the values that the correct processors use to mask the faults is computed on the fly during the execution of the protocol.

AB - In a Distributed Consensus protocol n processors, of which at most t may be faulty, are given initial binary values; after exchanging messages all the processors that are correct must agree on one of the initial values. We measure the quality of a consensus protocol by the following parameters: the total number of processors n, the number of rounds of message exchange r, and the communication complexity, given by the maximal message size. This paper presents a protocol that achieves Distributed Consensus with n=(3 + ε)t, r=t + 1, and polynomial message size for ε ≥ 1/log t, Thus, this is the first consensus protocol to use simultaneously nearly optimal number of processors (n= 3t + 1 is the known lower bound). optimal number of rounds, and short messages. Previous round-optimal protocols with polynomial communication required n=Ω(t2), n > 6t and n > 4t, respectively. In order to obtain this result, we introduce new techniques for the abbreviation of messages in the classical full information consensus protocol. In particular, we introduce the Dynamic Fault Masking technique, called that way because the values that the correct processors use to mask the faults is computed on the fly during the execution of the protocol.

UR - http://www.scopus.com/inward/record.url?scp=85029800505&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85029800505&partnerID=8YFLogxK

U2 - 10.1007/BFb0022442

DO - 10.1007/BFb0022442

M3 - Conference contribution

AN - SCOPUS:85029800505

SN - 9783540552369

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 129

EP - 142

BT - Distributed Algorithms - 5th International Workshop, WDAG 1991, Proceedings

A2 - Spirakis, Paul G.

A2 - Kirousis, Lefteris

A2 - Toueg, Sam

PB - Springer Verlag

T2 - 5th International Workshop on Distributed Algorithms, WDAG 1991

Y2 - 7 October 1991 through 9 October 1991

ER -