TY - GEN

T1 - Towards optimal distributed consensus

AU - Berman, Piotr

AU - Garay, Juan A.

AU - Perry, Kenneth J.

PY - 1989

Y1 - 1989

N2 - In a distributed consensus protocol all processors (of which t may be faulty) are given (binary) initial values; after exchanging messages all correct processors must agree on one of them. The quality of a protocol is measured here using as parameters the total number of processors n, number of rounds of message exchange r, and maximal message length m, with optima, respectively, of 3t + 1, t + 1, and 1. Although no known protocol is optimal in all these three aspects simultaneously, the protocols that take further steps in this direction are presented. The first protocol has n > 4t, r = t + 1, and polynomial message size. The second protocol has n > 3t, r = 3t + 3, and m = 2, and it is asymptotically optimal in all three quality parameters while using the optimal number of processors. Using these protocols as building blocks, families of protocols with intermediate quality parameters, offering better tradeoffs than previous results, are obtained. All the protocols work in polynomial time and have succinct descriptions.

AB - In a distributed consensus protocol all processors (of which t may be faulty) are given (binary) initial values; after exchanging messages all correct processors must agree on one of them. The quality of a protocol is measured here using as parameters the total number of processors n, number of rounds of message exchange r, and maximal message length m, with optima, respectively, of 3t + 1, t + 1, and 1. Although no known protocol is optimal in all these three aspects simultaneously, the protocols that take further steps in this direction are presented. The first protocol has n > 4t, r = t + 1, and polynomial message size. The second protocol has n > 3t, r = 3t + 3, and m = 2, and it is asymptotically optimal in all three quality parameters while using the optimal number of processors. Using these protocols as building blocks, families of protocols with intermediate quality parameters, offering better tradeoffs than previous results, are obtained. All the protocols work in polynomial time and have succinct descriptions.

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

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

U2 - 10.1109/sfcs.1989.63511

DO - 10.1109/sfcs.1989.63511

M3 - Conference contribution

AN - SCOPUS:0024770143

SN - 0818619821

SN - 9780818619823

T3 - Annual Symposium on Foundations of Computer Science (Proceedings)

SP - 410

EP - 415

BT - Annual Symposium on Foundations of Computer Science (Proceedings)

PB - Publ by IEEE

T2 - 30th Annual Symposium on Foundations of Computer Science

Y2 - 30 October 1989 through 1 November 1989

ER -