Randomized distributed agreement revisited

Piotr Berman, Juan A. Garay

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

    18 Citations (Scopus)

    Abstract

    Distributed Agreement (DA) is one of the fundamental problems in the theory and practice of fault-tolerant distributed systems. It requires correct processors (agents, players) to agree on an initial value held by one of them, despite the (even malicious) behavior of a subset of size t. A randomized solution to the problem achieves agreement with a high probability after a constant number of communication rounds. In this paper we present a succinct and efficient randomized DA protocol for asynchronous networks that works for n > 5t processors, where n is the size of the network. The protocol has low communication complexity (Θ(log n) message size) and does not require an cryptographic assumption. The protocol belongs to the class of protocols that require a `trusted dealer,' who is in charge of a suitable network initialization, and represents an improvement in terms of number of processors to previous solutions presented in. We contrast our approach to the class of protocols that are currently able to perform randomized agreement from scratch, an unlimited number of times, but have a communication cost that might be infeasible in many cases.

    Original languageEnglish (US)
    Title of host publicationDigest of Papers - International Symposium on Fault-Tolerant Computing
    Editors Anon
    PublisherPubl by IEEE
    Pages412-419
    Number of pages8
    ISBN (Print)0818636823
    StatePublished - Dec 1 1993
    EventProceedings of the 23rd International Symposium on Fault-Tolerant Computing - Toulouse, Fr
    Duration: Jun 22 1993Jun 24 1993

    Publication series

    NameDigest of Papers - International Symposium on Fault-Tolerant Computing
    ISSN (Print)0731-3071

    Other

    OtherProceedings of the 23rd International Symposium on Fault-Tolerant Computing
    CityToulouse, Fr
    Period6/22/936/24/93

    Fingerprint

    Communication
    Costs

    All Science Journal Classification (ASJC) codes

    • Hardware and Architecture

    Cite this

    Berman, P., & Garay, J. A. (1993). Randomized distributed agreement revisited. In Anon (Ed.), Digest of Papers - International Symposium on Fault-Tolerant Computing (pp. 412-419). (Digest of Papers - International Symposium on Fault-Tolerant Computing). Publ by IEEE.
    Berman, Piotr ; Garay, Juan A. / Randomized distributed agreement revisited. Digest of Papers - International Symposium on Fault-Tolerant Computing. editor / Anon. Publ by IEEE, 1993. pp. 412-419 (Digest of Papers - International Symposium on Fault-Tolerant Computing).
    @inproceedings{5b377aacaf944889869362d319d03537,
    title = "Randomized distributed agreement revisited",
    abstract = "Distributed Agreement (DA) is one of the fundamental problems in the theory and practice of fault-tolerant distributed systems. It requires correct processors (agents, players) to agree on an initial value held by one of them, despite the (even malicious) behavior of a subset of size t. A randomized solution to the problem achieves agreement with a high probability after a constant number of communication rounds. In this paper we present a succinct and efficient randomized DA protocol for asynchronous networks that works for n > 5t processors, where n is the size of the network. The protocol has low communication complexity (Θ(log n) message size) and does not require an cryptographic assumption. The protocol belongs to the class of protocols that require a `trusted dealer,' who is in charge of a suitable network initialization, and represents an improvement in terms of number of processors to previous solutions presented in. We contrast our approach to the class of protocols that are currently able to perform randomized agreement from scratch, an unlimited number of times, but have a communication cost that might be infeasible in many cases.",
    author = "Piotr Berman and Garay, {Juan A.}",
    year = "1993",
    month = "12",
    day = "1",
    language = "English (US)",
    isbn = "0818636823",
    series = "Digest of Papers - International Symposium on Fault-Tolerant Computing",
    publisher = "Publ by IEEE",
    pages = "412--419",
    editor = "Anon",
    booktitle = "Digest of Papers - International Symposium on Fault-Tolerant Computing",

    }

    Berman, P & Garay, JA 1993, Randomized distributed agreement revisited. in Anon (ed.), Digest of Papers - International Symposium on Fault-Tolerant Computing. Digest of Papers - International Symposium on Fault-Tolerant Computing, Publ by IEEE, pp. 412-419, Proceedings of the 23rd International Symposium on Fault-Tolerant Computing, Toulouse, Fr, 6/22/93.

    Randomized distributed agreement revisited. / Berman, Piotr; Garay, Juan A.

    Digest of Papers - International Symposium on Fault-Tolerant Computing. ed. / Anon. Publ by IEEE, 1993. p. 412-419 (Digest of Papers - International Symposium on Fault-Tolerant Computing).

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

    TY - GEN

    T1 - Randomized distributed agreement revisited

    AU - Berman, Piotr

    AU - Garay, Juan A.

    PY - 1993/12/1

    Y1 - 1993/12/1

    N2 - Distributed Agreement (DA) is one of the fundamental problems in the theory and practice of fault-tolerant distributed systems. It requires correct processors (agents, players) to agree on an initial value held by one of them, despite the (even malicious) behavior of a subset of size t. A randomized solution to the problem achieves agreement with a high probability after a constant number of communication rounds. In this paper we present a succinct and efficient randomized DA protocol for asynchronous networks that works for n > 5t processors, where n is the size of the network. The protocol has low communication complexity (Θ(log n) message size) and does not require an cryptographic assumption. The protocol belongs to the class of protocols that require a `trusted dealer,' who is in charge of a suitable network initialization, and represents an improvement in terms of number of processors to previous solutions presented in. We contrast our approach to the class of protocols that are currently able to perform randomized agreement from scratch, an unlimited number of times, but have a communication cost that might be infeasible in many cases.

    AB - Distributed Agreement (DA) is one of the fundamental problems in the theory and practice of fault-tolerant distributed systems. It requires correct processors (agents, players) to agree on an initial value held by one of them, despite the (even malicious) behavior of a subset of size t. A randomized solution to the problem achieves agreement with a high probability after a constant number of communication rounds. In this paper we present a succinct and efficient randomized DA protocol for asynchronous networks that works for n > 5t processors, where n is the size of the network. The protocol has low communication complexity (Θ(log n) message size) and does not require an cryptographic assumption. The protocol belongs to the class of protocols that require a `trusted dealer,' who is in charge of a suitable network initialization, and represents an improvement in terms of number of processors to previous solutions presented in. We contrast our approach to the class of protocols that are currently able to perform randomized agreement from scratch, an unlimited number of times, but have a communication cost that might be infeasible in many cases.

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

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

    M3 - Conference contribution

    AN - SCOPUS:0027868957

    SN - 0818636823

    T3 - Digest of Papers - International Symposium on Fault-Tolerant Computing

    SP - 412

    EP - 419

    BT - Digest of Papers - International Symposium on Fault-Tolerant Computing

    A2 - Anon, null

    PB - Publ by IEEE

    ER -

    Berman P, Garay JA. Randomized distributed agreement revisited. In Anon, editor, Digest of Papers - International Symposium on Fault-Tolerant Computing. Publ by IEEE. 1993. p. 412-419. (Digest of Papers - International Symposium on Fault-Tolerant Computing).