Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms

DOI10.1007/978-3-662-47666-6_42zbMath1417.68012arXiv1408.0620OpenAlexW2152755966MaRDI QIDQ3449502

Thomas Nowak, Matthias Függer, Bernadette Charron-Bost

Publication date: 4 November 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.0620

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (15)

Derivation of Heard-of Predicates from Elementary Behavioral Patterns ⋮ On the radius of nonsplit graphs and information dissemination in dynamic networks ⋮ Unnamed Item ⋮ On linear-time data dissemination in dynamic rooted trees ⋮ MinMax algorithms for stabilizing consensus ⋮ Approximate agreement under mobile Byzantine faults ⋮ Consensus in rooted dynamic networks with short-lived stability ⋮ Unnamed Item ⋮ Packet efficient implementation of the Omega failure detector ⋮ A topological perspective on distributed network algorithms ⋮ Fast Multidimensional Asymptotic and Approximate Consensus ⋮ Unnamed Item ⋮ Extension of PID Regulators to Dynamical Systems on Smooth Manifolds (M-PID) ⋮ Synthesis in presence of dynamic links ⋮ Minimal control effort and time Lie-group synchronisation design based on proportional-derivative control

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sets of matrices all infinite products of which converge
• The Heard-Of model: computing in distributed systems with benign faults
• A Characterization of Dynamic Networks Where Consensus Is Solvable
• Distributed computation in dynamic networks
• Coordinated consensus in dynamic networks
• Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
• Reaching a Consensus in a Dynamically Changing Environment: Convergence Rates, Measurement Delays, and Asynchronous Events
• Reaching approximate agreement in the presence of faults
• Impossibility of distributed consensus with one faulty process
• Are wait-free algorithms fast?
• Time is not a healer
• How to Decide Consensus? A Combinatorial Necessary and Sufficient Condition and a Proof that Consensus is Decidable but NP-Hard
• Degree Fluctuations and the Convergence Time of Consensus Algorithms

This page was built for publication: Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms