Optimal maintenance of a spanning tree

  • Authors:
  • Baruch Awerbuch;Israel Cidon;Shay Kutten

  • Affiliations:
  • Johns Hopkins University, Baltimore, Maryland;Technion, Haifa, Israel;Technion, Haifa, Israel

  • Venue:
  • Journal of the ACM (JACM)
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.