Fault-tolerant broadcasts

DOI10.1016/0167-6423(84)90009-1MaRDI QIDQ790609zbMATH OpenOpenAlexFDO

Authors Fred B. Schneider, David Gries, Richard D. Schlichting

Publication date 1984

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://hdl.handle.net/1813/6377

zbMATH Keywords

computer networksfault-tolerant broadcast protocolfault-tolerant computing

Mathematics Subject Classification ID

Theory of operating systems (68N25) Specification and verification (program logics, model checking, etc.) (68Q60)

Review text

In computer networks, fault-tolerant broadcast ensures delivery of messages to the functioning network nodes despite the fact that nodes may fail at any time. In this paper, a fault-tolerant broadcast protocol that works with any broadcast strategy is pesented and proved correct.

Recommendations

• scientific article; zbMATH DE number 908506
• Fault-tolerant broadcast graphs
• scientific article; zbMATH DE number 961881
• Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults
• Fault—tolerant hypercube broadcasting via information dispersal

Cited in

(6)

• Uniform reliable broadcast in anonymous distributed systems with fair lossy channels
• scientific article; zbMATH DE number 4058841 (Why is no real title available?)
• scientific article; zbMATH DE number 1107712 (Why is no real title available?)
• Design and analysis of dynamic leader election protocols in broadcast networks
• Tolerating corrupted communication
• Adaptive broadcast by fault-tolerant spanning tree switching

This page was built for publication: Fault-tolerant broadcasts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790609)