Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures

Piotr Berman, Krzysztof Diks, Andrzej Pelc

    Research output: Contribution to journalArticle

    19 Scopus citations

    Abstract

    Broadcasting is a process of transmitting a message held in one node of a communication network to all other nodes. Links of the network are subject to randomly and independently distributed faults with probability 0 < q < 1/2; faults are permanent and Byzantine, while all nodes are fault-free. In a unit of time, each node can communicate with at most one other node. We present a broadcasting algorithm which works for n nodes in time O(log n) with probability of correctness exceeding 1 - 1/n, for sufficiently large n.

    Original languageEnglish (US)
    Pages (from-to)199-211
    Number of pages13
    JournalJournal of Algorithms
    Volume22
    Issue number2
    DOIs
    StatePublished - Feb 1997

    All Science Journal Classification (ASJC) codes

    • Control and Optimization
    • Computational Mathematics
    • Computational Theory and Mathematics

    Fingerprint Dive into the research topics of 'Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures'. Together they form a unique fingerprint.

  • Cite this