Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures

Piotr Berman; Krzysztof Diks; Andrzej Pelc

doi:10.1006/jagm.1996.0810

Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures

Piotr Berman, Krzysztof Diks, Andrzej Pelc

Research output: Contribution to journal › Article › peer-review

20 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 language	English (US)
Pages (from-to)	199-211
Number of pages	13
Journal	Journal of Algorithms
Volume	22
Issue number	2
DOIs	https://doi.org/10.1006/jagm.1996.0810
State	Published - Feb 1997

All Science Journal Classification (ASJC) codes

Control and Optimization
Computational Mathematics
Computational Theory and Mathematics

Access to Document

10.1006/jagm.1996.0810

Cite this

@article{fbb0114a931b4c00a4c0b2a253539374,

title = "Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures",

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.",

author = "Piotr Berman and Krzysztof Diks and Andrzej Pelc",

note = "Funding Information: * Partly supported by NSERC International Fellowship and Grant KBN 2-2043-92-03. ² Partly supported by NSERC Grant OGP 0008136.",

year = "1997",

month = feb,

doi = "10.1006/jagm.1996.0810",

language = "English (US)",

volume = "22",

pages = "199--211",

journal = "Journal of Algorithms",

issn = "0196-6774",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

T1 - Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures

AU - Berman, Piotr

AU - Diks, Krzysztof

AU - Pelc, Andrzej

N1 - Funding Information: * Partly supported by NSERC International Fellowship and Grant KBN 2-2043-92-03. ² Partly supported by NSERC Grant OGP 0008136.

PY - 1997/2

Y1 - 1997/2

N2 - 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.

AB - 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.

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

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

U2 - 10.1006/jagm.1996.0810

DO - 10.1006/jagm.1996.0810

M3 - Article

AN - SCOPUS:0039164244

VL - 22

SP - 199

EP - 211

JO - Journal of Algorithms

JF - Journal of Algorithms

SN - 0196-6774

IS - 2

ER -

Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this