Appears in Proceedings of the
ACM Symposium on Parallel Algorithms and Architectures (SPAA 2004)
We devise an object location scheme that achieves a guaranteed
low stretch in a wider and more realistic class of networks than
The distinctive feature of our scheme is that it is
inherently adaptive to the underlying topology.
In particular, the system achieves $1+\epsilon$ stretch
(for arbitrarily fixed $\epsilon>0$),
with a neighbor list size that depends on the
local density around the node (but not on the global growth rate bound).
As a byproduct, our scheme has several advantages over existing ones,
such as robustness to errors in network measurements, and simpler
design choices of system builders, which may lead to improved and
more robust deployments.