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

DOI10.1016/j.ipl.2010.04.003zbMath1233.68102OpenAlexW2093808378MaRDI QIDQ763544

Akira Ichimura, Maiko Shigeno

Publication date: 12 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://tsukuba.repo.nii.ac.jp/?action=repository_action_common_download&item_id=19876&item_no=1&attribute_id=17&file_no=1

zbMATH Keywords

graph algorithmfault tolerancebroadcastingByzantine faultsMA ordering

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items

Reliable broadcast with respect to topology knowledge, Consensus of second-order multi-agent systems in the presence of locally bounded faults, Consensus of discrete-time multi-agent systems with adversaries and time delays, Broadcast using certified propagation algorithm in presence of Byzantine faults

Cites Work

• Unnamed Item
• Broadcasting with locally bounded byzantine faults
• Algorithmic Aspects of Graph Connectivity
• Broadcast in radio networks tolerating byzantine adversarial behavior
• Fault-tolerant broadcasting and gossiping in communication networks