The Computer Journal
Local management of a global resource in a communication network
Journal of the ACM (JACM)
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A Space Lower Bound for Routing in Trees
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Compact oracles for reachability and approximate distances in planar digraphs
Journal of the ACM (JACM)
Object location using path separators
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Controller and estimator for dynamic networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Labeling schemes for weighted dynamic trees
Information and Computation
Compact name-independent routing with minimum stretch
ACM Transactions on Algorithms (TALG)
Dynamic routing schemes for graphs with low local density
ACM Transactions on Algorithms (TALG)
Upper and lower bounds for routing schemes in dynamic networks
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Improved compact routing schemes for dynamic trees
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Controller and estimator for dynamic networks
Information and Computation
| Hi-index | 0.00 |
This paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We present two routing schemes for dynamic trees that maintain labels of asymptotically optimal size using extremely low average message complexity (per node). Specifically, we first present a dynamic routing scheme that supports additions of both leaves and internal nodes, maintains asymptotically optimal labels and incurs only O (log2 n /log2logn ) average message complexity. This routing scheme is then extended to supports also deletions of nodes of degree at most 2. The extended scheme incurs O (log2 n ) average message complexity and still maintains asymptotically optimal labels. We would like to point out that the best known routing scheme for dynamic trees that maintains asymptotically optimal labels in the fixed port model has very high average message complexity, namely, O (n *** ). Moreover, that scheme supports additions and removals of leaf nodes only.