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

Piotr Berman, Juan A. Garay

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    3 Scopus citations

    Abstract

    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.

    Original languageEnglish (US)
    Title of host publicationDistributed Algorithms - 5th International Workshop, WDAG 1991, Proceedings
    EditorsPaul G. Spirakis, Lefteris Kirousis, Sam Toueg
    PublisherSpringer Verlag
    Pages129-142
    Number of pages14
    ISBN (Print)9783540552369
    DOIs
    StatePublished - 1992
    Event5th International Workshop on Distributed Algorithms, WDAG 1991 - Delphi, Greece
    Duration: Oct 7 1991Oct 9 1991

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume579 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    Other5th International Workshop on Distributed Algorithms, WDAG 1991
    CountryGreece
    CityDelphi
    Period10/7/9110/9/91

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Computer Science(all)

    Fingerprint Dive into the research topics of 'Efficient distributed consensus with n=(3 + ∊)t processors'. Together they form a unique fingerprint.

  • Cite this

    Berman, P., & Garay, J. A. (1992). Efficient distributed consensus with n=(3 + ∊)t processors. In P. G. Spirakis, L. Kirousis, & S. Toueg (Eds.), Distributed Algorithms - 5th International Workshop, WDAG 1991, Proceedings (pp. 129-142). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 579 LNCS). Springer Verlag. https://doi.org/10.1007/BFb0022442