Randomization can be a healer: consensus with dynamic omission failures

DOI10.1007/s00446-010-0116-2zbMath1231.68088OpenAlexW2093092818WikidataQ57603657 ScholiaQ57603657MaRDI QIDQ661060

Paulo Veríssimo, Miguel Correia, Nuno Ferreira Neves, Henrique Moniz

Publication date: 6 February 2012

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-010-0116-2

zbMATH Keywords

wireless ad-hoc networksconsensus protocoldynamic communication failures

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Operating systems. An advanced course
• A tradeoff between safety and liveness for randomized coordinated attack
• Lower bounds for asynchronous consensus
• The Heard-Of model: computing in distributed systems with benign faults
• Consensus and collision detectors in radio networks
• Agreement in synchronous networks with ubiquitous faults
• Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
• Impossibility Results and Lower Bounds for Consensus under Link Failures
• Distributed agreement in the presence of processor and communication faults
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Unreliable failure detectors for reliable distributed systems
• Fast asynchronous Byzantine agreement with optimal resilience
• Tolerating corrupted communication

This page was built for publication: Randomization can be a healer: consensus with dynamic omission failures