Complexity of network synchronization
Journal of the ACM (JACM)
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Generalized Scheme for Topology-Update in Dynamic Networks
Proceedings of the 2nd International Workshop on Distributed Algorithms
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Local management of a global resource in a communication network
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Maintenance of a Spanning Tree in Dynamic Networks
Proceedings of the 13th International Symposium on Distributed Computing
Distributed Probabilistic Polling and Applications to Proportionate Agreement
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Local management of a global resource in a communication network
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Optimal maintenance of a spanning tree
Journal of the ACM (JACM)
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
Towards robust and efficient computation in dynamic peer-to-peer networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Distributed computing in fault-prone dynamic networks
Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems
Controller and estimator for dynamic networks
Information and Computation
Sublinear-Time maintenance of breadth-first spanning tree in partially dynamic networks
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
This paper addresses the problem of how to adapt an algorithm designed for fixed topology networks to produce the intended results, when run in a network whose topology changes dynamically, in spite of encountering topological changes during its execution. We present a simple and unified procedure, called a reset procedure, which, when combined with the static algorithm, achieves this adaptation. The communication and time complexities of the reset procedure, per topological change, are independent of the number of topological changes and are linearly bounded by the size of the subset of the network which participates in the algorithm.