A characterization of oblivious message adversaries for which consensus is solvable

DOI10.1016/j.tcs.2015.01.024zbMath1315.68008OpenAlexW2013154696MaRDI QIDQ2345460

Joseph G. Peters, Emmanuel Godard, Étienne Coulouma

Publication date: 22 May 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.01.024

zbMATH Keywords

message passingconsensusdynamic networkssynchronousmessage adversaryoblivious faultsomission faults

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items

Derivation of Heard-of Predicates from Elementary Behavioral Patterns, Valency-based consensus under message adversaries without limit-closure, Some lower bounds in dynamic networks with oblivious adversaries, Synchronous \(t\)-resilient consensus in arbitrary graphs, Blockchain in dynamic networks, MinMax algorithms for stabilizing consensus, Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks, Consensus in rooted dynamic networks with short-lived stability, A topological perspective on distributed network algorithms, Unnamed Item, Back to the Coordinated Attack Problem, Synthesis in presence of dynamic links

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Heard-Of model: computing in distributed systems with benign faults
• Agreement in synchronous networks with ubiquitous faults
• A Layered Analysis of Consensus
• A Characterization of Dynamic Networks Where Consensus Is Solvable
• Distributed computation in dynamic networks
• Coordinated consensus in dynamic networks
• Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults
• Impossibility Results and Lower Bounds for Consensus under Link Failures
• Reaching Agreement in the Presence of Faults
• Time is not a healer
• Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors