A Characterization of Dynamic Networks Where Consensus Is Solvable

DOI10.1007/978-3-319-03578-9_3zbMath1406.68003OpenAlexW204775459MaRDI QIDQ2868629

Étienne Coulouma, Emmanuel Godard

Publication date: 17 December 2013

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03578-9_3

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)

Related Items (6)

Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms ⋮ Unnamed Item ⋮ Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks ⋮ Unnamed Item ⋮ A characterization of oblivious message adversaries for which consensus is solvable ⋮ On the expressivity of time-varying graphs

Cites Work

• 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
• 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

This page was built for publication: A Characterization of Dynamic Networks Where Consensus Is Solvable