Broadcasting in complete networks with faulty nodes using unreliable calls

DOI10.1016/0020-0190(91)90174-GzbMath0743.94027OpenAlexW1972925646MaRDI QIDQ1183465

Andrzej Pelc

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90174-g

zbMATH Keywords

algorithmnodesfault tolerancebroadcastingrandom faultscomplete communication network

Mathematics Subject Classification ID

Circuits, networks (94C99) Fault detection; testing in circuits and networks (94C12)

Related Items (4)

Reliable broadcasting ⋮ Reliable Broadcasting in Hypercubes with Random Link and Node Failures ⋮ Deterministic Models of Communication Faults ⋮ Rapid almost-complete broadcasting in faulty networks

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
• Tighter time bounds on fault-tolerant broadcasting and gossiping
• Almost Safe Gossiping in Bounded Degree Networks
• Broadcasting in synchronous networks with dynamic faults

This page was built for publication: Broadcasting in complete networks with faulty nodes using unreliable calls