A new parameter for a broadcast algorithm with locally bounded Byzantine faults

Information Processing Letters

Volumn 110, Issue 12-13, 2010, Pages 514-517

  Ichimura, Akira ^a   Shigeno, Maiko ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

Broadcasting; Byzantine faults; Fault tolerance; Graph algorithm; MA ordering

Indexed keywords

FAULT TOLERANCE; GRAPH THEORY;

BROADCAST ALGORITHM; BROADCASTING ALGORITHM; BYZANTINE FAILURES; BYZANTINE FAULT; GLOBAL KNOWLEDGE; GRAPH ALGORITHMS; MA ORDERINGS; PROPAGATION ALGORITHM;

BROADCASTING;

EID: 84857923236     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2010.04.003     Document Type: Article

References (5)

1. M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, 1979.
2. C.Y. Koo, Broadcast in radio networks tolerating Byzantine adversarial behavior, in: Proc. PODC, 2004.
3. H. Nagamochi, T. Ibaraki, Algorithmic Aspects of Graph Connectivity, Cambridge University Press, 2008.
4. A. Pelc, Fault-tolerant broadcasting and gossiping in communication networks, Networks 28 (1996) 143-156.
5. A. Pelc, D. Peleg, Broadcasting with locally bounded Byzantine faults, Inform. Process. Lett. 93 (2005) 109-115.