Sparse networks supporting efficient reliable broadcasting

DOI10.1007/3-540-56939-1_88zbMath1418.68009OpenAlexW1565023826MaRDI QIDQ4630277

Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc

Publication date: 29 March 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56939-1_88

zbMATH Keywords

faulty nodelogarithmic timesparse networksource informationfixed probability

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items

Broadcasting in hypercubes with randomly distributed Byzantine faults

Cites Work

• A guided tour of Chernoff bounds
• Optimal and near-optimal broadcast in random graphs
• Broadcasting with random faults
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• On Gossiping with Faulty Telephone Lines
• Telephone Problems with Failures
• A survey of gossiping and broadcasting in communication networks
• Gossiping in Minimal Time
• Tighter time bounds on fault-tolerant broadcasting and gossiping
• Almost Safe Gossiping in Bounded Degree Networks