FAST BROADCASTING WITH BYZANTINE FAULTS

DOI10.1142/S0129054106004492zbMath1120.68112OpenAlexW2071898078MaRDI QIDQ3421854

Andrzej Pelc, Michel Paquette

Publication date: 8 February 2007

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054106004492

zbMATH Keywords

algorithmcommunication networkbroadcastingByzantine fault

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)

Related Items (1)

The diameter and connectivity of networks with random dependent faults

Cites Work

• Unnamed Item
• A guided tour of Chernoff bounds
• Broadcasting with random faults
• Methods and problems of communication in usual networks
• Optimal adaptive broadcasting with a bounded fraction of faulty nodes
• Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures
• Telephone Problems with Failures
• A survey of gossiping and broadcasting in communication networks
• Tighter time bounds on fault-tolerant broadcasting and gossiping
• Almost Safe Gossiping in Bounded Degree Networks
• Optimal communication in networks with randomly distributed byzantine faults
• Information dissemination in distributed systems with faulty units
• Time bounds on fault‐tolerant broadcasting
• Fault-tolerant broadcasting and gossiping in communication networks

This page was built for publication: FAST BROADCASTING WITH BYZANTINE FAULTS