Theory of Computing Systems

, Volume 37, Issue 1, pp 49–75

Labeling Schemes for Dynamic Tree Networks

Article

DOI: 10.1007/s00224-003-1106-6

Cite this article as:
Korman, A., Peleg, D. & Rodeh, Y. Theory Comput Systems (2004) 37: 49. doi:10.1007/s00224-003-1106-6
  • 54 Downloads

Abstract

Distance labeling schemes are composed of a marker algorithm for labeling the vertices of a graph with short labels, coupled with a decoder algorithm allowing one to compute the distance between any two vertices directly from their labels (without using any additional information). As applications for distance labeling schemes concern mainly large and dynamically changing networks, it is of interest to study distributed dynamic labeling schemes. The current paper considers the problem on dynamic trees, and proposes efficient distributed schemes for it. The paper first presents a labeling scheme for distances in the dynamic tree model, with amortized message complexity O(log2n) per operation, where n is the size of the tree at the time the operation takes place. The protocol maintains O(log2n) bit labels. This label size is known to be optimal even in the static scenario. A more general labeling scheme is then introduced for the dynamic tree model, based on extending an existing static tree labeling scheme to the dynamic setting. The approach fits a number of natural tree functions, such as distance, separation level, and flow. The main resulting scheme incurs an overhead of an O(log n) multiplicative factor in both the label size and amortized message complexity in the case of dynamically growing trees (with no vertex deletions). If an upper bound on n is known in advance, this method yields a different tradeoff, with an O(log2n/log log n) multiplicative overhead on the label size but only an O(log n/log log n) overhead on the amortized message complexity. In the fully dynamic model the scheme also incurs an increased additive overhead in amortized communication, of O(log2n) messages per operation.

Copyright information

© Springer-Verlag 2003

Authors and Affiliations

  1. 1.Department of Computer Science and Applied Mathematics, The Weizmann Institute of Science, Rehovot, 76100 Israel

Personalised recommendations