Complexity of network synchronization
Journal of the ACM (JACM)
A protocol to maintain a minimum spanning tree in a dynamic topology
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
End-to-end communication in unreliable networks
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Optimal lower bounds for some distributed algorithms for a complete network of processors
Theoretical Computer Science
Computer Networks and ISDN Systems
A unified approach to loop-free routing using distance vectors or link states
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A loop-free extended Bellman-Ford routing protocol without bouncing effect
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A new responsive distributed shortest-path rounting algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A trade-off between information and communication in broadcast protocols
Journal of the ACM (JACM)
On the effects of feedback in dynamic network protocols
Journal of Algorithms
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
A quantitative approach to dynamic networks
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Memory-efficient self stabilizing protocols for general networks
Proceedings of the 4th international workshop on Distributed algorithms
Bootstrap network resynchronization (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Self-stabilization by local checking and correction (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The slide mechanism with applications in dynamic networks
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
On finding and updating shortest paths distributively
Journal of Algorithms
Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
Distributed, scalable routing based on link-state vectors
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
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)
Overview of the NBBS architecture
IBM Systems Journal
Slide—the key to polynomial end-to-end communication
Journal of Algorithms
The maintenance of common data in a distributed system
Journal of the ACM (JACM)
Optimal Broadcast with Partial Knowledge
SIAM Journal on Computing
Interconnections (2nd ed.): bridges, routers, switches, and internetworking protocols
Interconnections (2nd ed.): bridges, routers, switches, and internetworking protocols
OPENET: an open and efficient control platform for ATM networks
Journal of High Speed Networks
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Graph Algorithms
Computer Networks
IEEE Transactions on Computers
Multicast group membership management
IEEE/ACM Transactions on Networking (TON)
Distributed Algorithms for Updating Shortest Paths (Extended Abstract)
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
A fully dynamic algorithm for distributed shortest paths
Theoretical Computer Science - Latin American theoretical informatics
Cisco LAN Switching Fundamentals
Cisco LAN Switching Fundamentals
A distributed algorithm for constructing a minimum diameter spanning tree
Journal of Parallel and Distributed Computing
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Dynamic deadlock resolution protocols
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Applying static network protocols to dynamic networks
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Dynamic networks are as fast as static networks
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Polynomial end-to-end communication
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Communication-optimal maintenance of replicated information
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
New models and algorithms for future networks
IEEE Transactions on Information Theory
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 |
In this article, we show that keeping track of history enables significant improvements in the communication complexity of dynamic network protocols. We present a communication optimal maintenance of a spanning tree in a dynamic network. The amortized (on the number of topological changes) message complexity is O(V), where V is the number of nodes in the network. The message size used by the algorithm is O(log |ID|) where |ID| is the size of the name space of the nodes. Typically, log |ID| = O(log V). Previous algorithms that adapt to dynamic networks involved Ω (E) messages per topological change—inherently paying for re-computation of the tree from scratch. Spanning trees are essential components in many distributed algorithms. Some examples include broadcast (dissemination of messages to all network nodes), multicast, reset (general adaptation of static algorithms to dynamic networks), routing, termination detection, and more. Thus, our efficient maintenance of a spanning tree implies the improvement of algorithms for these tasks. Our results are obtained using a novel technique to save communication. A node uses information received in the past in order to deduce present information from the fact that certain messages were NOT sent by the node's neighbor. This technique is one of our main contributions.