Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science on STACS 89
Adapting to asynchronous dynamic networks (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The slide mechanism with applications in dynamic networks
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Tolerating corrupted communication
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Impossibility Results and Lower Bounds for Consensus under Link Failures
SIAM Journal on Computing
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
CTRQ '10 Proceedings of the 2010 Third International Conference on Communication Theory, Reliability, and Quality of Service
Dynamic networks: models and algorithms
ACM SIGACT News
Coordinated consensus in dynamic networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Synchronous consensus under hybrid process and link failures
Theoretical Computer Science
Time-varying graphs and dynamic networks
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
Solving k-Set Agreement with Stable Skeleton Graphs
IPDPSW '11 Proceedings of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum
Mathematical and Computer Modelling: An International Journal
Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
We study the fundamental problem of achieving consensus in a synchronous dynamic network, where an omniscient adversary controls the unidirectional communication links. Its behavior is modeled as a sequence of directed graphs representing the active (i.e. timely) communication links per round. We prove that consensus is impossible under some natural weak connectivity assumptions, and introduce vertex-stable root components as a--practical and not overly strong--means for circumventing this impossibility. Essentially, we assume that there is a short period of time during which an arbitrary part of the network remains strongly connected, while its interconnect topology keeps changing continuously. We present a consensus algorithm that works under this assumption, and prove its correctness. Our algorithm maintains a local estimate of the communication graphs, and applies techniques for detecting stable network properties and univalent system configurations. Our possibility results are complemented by several impossibility results and lower bounds, which reveal that our algorithm is asymptotically optimal.