, Volume 37, Issue 3, pp 405-440

Distributed Object Location in a Dynamic Network

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

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