Optimal maintenance of a spanning tree

  title={Optimal maintenance of a spanning tree},
  author={Baruch Awerbuch and Israel Cidon and Shay Kutten},
  journal={J. ACM},
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… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 13 extracted citations

An efficient and message-optimal multicast routing protocol in mobile ad-hoc networks

The 2011 International Conference on Advanced Technologies for Communications (ATC 2011) • 2011
View 5 Excerpts
Highly Influenced

Distributed Tree Rearrangements for Reachability and Robust Connectivity

SIAM J. Control and Optimization • 2012
View 8 Excerpts
Highly Influenced

Distributed Computation and Maintenance of a Spanning Tree in Dynamic Networks by Mobile Agents

2016 30th International Conference on Advanced Information Networking and Applications Workshops (WAINA) • 2016
View 1 Excerpt

Proving distributed algorithms for mobile agents: Examples of spanning tree computation in dynamic networks

2015 IEEE/ACS 12th International Conference of Computer Systems and Applications (AICCSA) • 2015
View 1 Excerpt

Analysis and simulations of routing protocols with two different algorithms

2014 Twelfth International Conference on ICT and Knowledge Engineering • 2014
View 2 Excerpts


Publications referenced by this paper.
Showing 1-3 of 3 references

Resynch procedures and a fail-safe network protocol

Steven G. Finn
View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…