A characterization of dynamic networks where consensus is solvable

DOI10.1007/978-3-319-03578-9_3MaRDI QIDQ2868629zbMATH OpenOpenAlexFDO

Authors É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

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

Recommendations

• A characterization of oblivious message adversaries for which consensus is solvable
• Consensus in rooted dynamic networks with short-lived stability
• Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults
• Approximate consensus in highly dynamic networks: the role of averaging algorithms
• Coordinated consensus in dynamic networks

Cites work

• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 795590 (Why is no real title available?)
• A layered analysis of consensus
• Agreement in synchronous networks with ubiquitous faults
• Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults
• Coordinated consensus in dynamic networks
• Distributed computation in dynamic networks
• Impossibility Results and Lower Bounds for Consensus under Link Failures
• Reaching Agreement in the Presence of Faults
• The Heard-Of model: computing in distributed systems with benign faults

Cited in

(10)

• Coordinated consensus in dynamic networks
• A connectivity model for agreement in dynamic systems
• scientific article; zbMATH DE number 7455739 (Why is no real title available?)
• scientific article; zbMATH DE number 7561442 (Why is no real title available?)
• Round-Oblivious Stabilizing Consensus in Dynamic Networks
• Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
• A characterization of oblivious message adversaries for which consensus is solvable
• On the expressivity of time-varying graphs
• Consensus in rooted dynamic networks with short-lived stability
• Approximate consensus in highly dynamic networks: the role of averaging algorithms

This page was built for publication: A characterization of dynamic networks where consensus is solvable

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