Theory of Computing Systems

, Volume 37, Issue 3, pp 405–440

Distributed Object Location in a Dynamic Network

Article

DOI: 10.1007/s00224-004-1146-6

Cite this article as:
Hildrum, K., Kubiatowicz, J., Rao, S. et al. Theory Comput Syst (2004) 37: 405. doi:10.1007/s00224-004-1146-6

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].

Copyright information

© Springer-Verlag 2004

Authors and Affiliations

  1. 1.Computer Science Division, University of California at BerkeleyBerkeley, CA 94720USA