Routing in trees

Abstract

This article focuses on routing messages along shortest paths in tree networks, using compact distributed data structures. We mainly prove that n-node trees support routing schemes with message headers, node addresses, and local memory space of size O(log n) bits, and such that every local routing decision is taken in constant time. This improves the best known routing scheme by a factor of O(log n) in term of both memory requirements and routing time. Our routing scheme requires headers and addresses of size slightly larger than log n, motivated by an inherent trade-off between address-size and memory space, i.e., any routing scheme with addresses on log n bits requires ω(n) bits of local memory-space. This shows that a little variation of the address size, e.g., by an additive O(log n) bits factor, has a significant impact on the local memory space. © 2011 Springer-Verlag Berlin Heidelberg.