Tolerating corrupted communication

DOI10.1145/1281100.1281136MaRDI QIDQ5401417zbMATH OpenOpenAlexFDO

Authors Martin Biely, Josef Widder, Bernadette Charron-Bost, Antoine Gaillard, Martin Hutle, A. Schiper

Publication date 13 March 2014

Published in Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL http://infoscience.epfl.ch/record/124883

zbMATH Keywords

consensustransient faultsdynamic faultsbyzantine fault tolerance

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3846851
• Reliable communication under channel uncertainty
• Communication With Disturbance Constraints
• On Quiescent Reliable Communication
• Fault-tolerant broadcasts
• Reliable communication on emulated channels resilient to transient faults
• Expected reliability of communication protocols
• Reliable communication across parallel asynchronous channels with glitches
• Data communicating processes with unreliable channels
• Reliable communication over highly connected noisy networks

Cited in

(17)

• Higher-order quantifier elimination, counter simulations and fault-tolerant systems
• Characterizing Consensus in the Heard-Of Model
• Making Byzantine consensus live
• Making Byzantine consensus live
• Reachability in parameterized systems: all flavors of threshold automata
• Consensus when all processes may be Byzantine for some time
• Iterative approximate Byzantine consensus in arbitrary directed graphs
• Tutorial on parameterized model checking of fault-tolerant distributed algorithms
• Tolerating permanent and transient value faults
• The Heard-Of model: computing in distributed systems with benign faults
• Cardinality constraints for arrays (decidability results and applications)
• On the impact of link faults on Byzantine agreement
• Synchronous consensus under hybrid process and link failures
• Counting constraints in flat array fragments
• Bosco: One-Step Byzantine Asynchronous Consensus
• Randomization can be a healer: consensus with dynamic omission failures
• How Byzantine is a send corruption?

This page was built for publication: Tolerating corrupted communication

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