Abstract

We present an algorithm and two lower bounds for the problem of constructing and maintaining routing schemes in dynamic networks. The algorithm distributively assignes addresses to nodes and constructs routing tables in a dynamically growing tree. The resulting routing scheme routes data messages over the shortest path between any source and destination, assigns addresses of O(log^2 n) bits to each node, and uses in its routing tables O(log^3 n) bits of memory per incident link, where n is the final number of nodes in the tree. The amortized communication cost of the algorithm is O(log n) messages per node. We also give two lower bounds on the tradeoff between the quality of routing schemes (i.e., their stretch factor) and their amortized communication cost in general dynamic networks.

Citations