Abstract
Modern networking applications replicate data and services widely, leading to a need for location-independent routing—the ability to route queries to objects using names independent of the objects’ physical locations. Two important properties of such a routing infrastructure are routing locality and rapid adaptation to arriving and departing nodes.We showhowthese two properties can be efficiently achieved for certain network topologies. To do this, we present a new distributed algorithm that can solve the nearest-neighbor problem for these networks. We describe our solution in the context of Tapestry, an overlay network infrastructure that employs techniques proposed by Plaxton et al. [24].
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Hildrum, K., Kubiatowicz, J., Rao, S. et al. Distributed Object Location in a Dynamic Network. Theory Comput Syst 37, 405–440 (2004). https://doi.org/10.1007/s00224-004-1146-6
Issue Date:
DOI: https://doi.org/10.1007/s00224-004-1146-6