Consensus in rooted dynamic networks with short-lived stability
DOI10.1007/s00446-019-00348-0zbMath1451.68055arXiv1602.05852OpenAlexW2280546220WikidataQ92590714 ScholiaQ92590714MaRDI QIDQ2010603
Manfred Schwarz, Ulrich Schmid, Kyrill Winkler
Publication date: 27 November 2019
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.05852
consensusdynamic networksmessage adversaryeventual stabilityrooted directed graphsshort stability periods
Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (4)
Cites Work
- Synchronous consensus under hybrid process and link failures
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- A characterization of oblivious message adversaries for which consensus is solvable
- The Heard-Of model: computing in distributed systems with benign faults
- Distributed computation in dynamic networks
- Coordinated consensus in dynamic networks
- Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms
- Impossibility Results and Lower Bounds for Consensus under Link Failures
- Impossibility of distributed consensus with one faulty process
- Unreliable failure detectors for reliable distributed systems
- Time is not a healer
- Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors
- The weakest failure detectors to solve certain fundamental problems in distributed computing
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
This page was built for publication: Consensus in rooted dynamic networks with short-lived stability
