Broadcasting with locally bounded Byzantine faults

Andrzej Pelc; David Peleg

doi:10.1016/j.ipl.2004.10.007

Broadcasting with locally bounded Byzantine faults

Andrzej Pelc, David Peleg

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

93 Scopus citations

Abstract

The study of a broadcast in the t-locally bounded model in arbitrary graphs assuming Byzantine graphs were discussed. It was assumed that the nodes knew which node was the source and it was found that the focus was on the feasibility of communication. It was also found that all nodes must transmit separately in different rounds in order to avoid collisions in the radio model. The results show that the byzantine behavior of faulty nodes was restricted to the content of messages and did not effected the schedule.

Original language	English
Pages (from-to)	109-115
Number of pages	7
Journal	Information Processing Letters
Volume	93
Issue number	3
DOIs	https://doi.org/10.1016/j.ipl.2004.10.007
State	Published - 14 Feb 2005
Externally published	Yes

Bibliographical note

Funding Information:
* Corresponding author. E-mail addresses: [email protected] (A. Pelc), [email protected] (D. Peleg). 1Supported in part by NSERC grant OGP 0008136 and by the Research Chair in Distributed Computing of the Université du Québec en Outaouais.

Funding

* Corresponding author. E-mail addresses: [email protected] (A. Pelc), [email protected] (D. Peleg). 1Supported in part by NSERC grant OGP 0008136 and by the Research Chair in Distributed Computing of the Université du Québec en Outaouais.

Funders	Funder number
Université du Québec en Outaouais
Natural Sciences and Engineering Research Council of Canada	OGP 0008136

Keywords

Algorithms
Broadcast
Byzantine faults
Distributed computing
Fault tolerance

Access to Document

10.1016/j.ipl.2004.10.007

Cite this

@article{31d43abeaf594e128b32161761f0a36c,

title = "Broadcasting with locally bounded Byzantine faults",

abstract = "The study of a broadcast in the t-locally bounded model in arbitrary graphs assuming Byzantine graphs were discussed. It was assumed that the nodes knew which node was the source and it was found that the focus was on the feasibility of communication. It was also found that all nodes must transmit separately in different rounds in order to avoid collisions in the radio model. The results show that the byzantine behavior of faulty nodes was restricted to the content of messages and did not effected the schedule.",

keywords = "Algorithms, Broadcast, Byzantine faults, Distributed computing, Fault tolerance",

author = "Andrzej Pelc and David Peleg",

note = "Funding Information: * Corresponding author. E-mail addresses: [email protected] (A. Pelc), [email protected] (D. Peleg). 1Supported in part by NSERC grant OGP 0008136 and by the Research Chair in Distributed Computing of the Universit{\'e} du Qu{\'e}bec en Outaouais.",

year = "2005",

month = feb,

day = "14",

doi = "10.1016/j.ipl.2004.10.007",

language = "אנגלית",

volume = "93",

pages = "109--115",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - Broadcasting with locally bounded Byzantine faults

AU - Pelc, Andrzej

AU - Peleg, David

N1 - Funding Information: * Corresponding author. E-mail addresses: [email protected] (A. Pelc), [email protected] (D. Peleg). 1Supported in part by NSERC grant OGP 0008136 and by the Research Chair in Distributed Computing of the Université du Québec en Outaouais.

PY - 2005/2/14

Y1 - 2005/2/14

N2 - The study of a broadcast in the t-locally bounded model in arbitrary graphs assuming Byzantine graphs were discussed. It was assumed that the nodes knew which node was the source and it was found that the focus was on the feasibility of communication. It was also found that all nodes must transmit separately in different rounds in order to avoid collisions in the radio model. The results show that the byzantine behavior of faulty nodes was restricted to the content of messages and did not effected the schedule.

AB - The study of a broadcast in the t-locally bounded model in arbitrary graphs assuming Byzantine graphs were discussed. It was assumed that the nodes knew which node was the source and it was found that the focus was on the feasibility of communication. It was also found that all nodes must transmit separately in different rounds in order to avoid collisions in the radio model. The results show that the byzantine behavior of faulty nodes was restricted to the content of messages and did not effected the schedule.

KW - Algorithms

KW - Broadcast

KW - Byzantine faults

KW - Distributed computing

KW - Fault tolerance

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

U2 - 10.1016/j.ipl.2004.10.007

DO - 10.1016/j.ipl.2004.10.007

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:10444286785

SN - 0020-0190

VL - 93

SP - 109

EP - 115

JO - Information Processing Letters

JF - Information Processing Letters

IS - 3

ER -

Broadcasting with locally bounded Byzantine faults

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this