OceanStore Papers

The OceanStore Project
Paper Abstract

Distributed Object Location in Dynamic Networks
Kirsten Hildrum, John D. Kubiatowicz, Satish Rao and Ben Y. Zhao.

U.C. Berkeley Technical Report UCB//CSD-02-1178, April 2002.

Modern networking applications replicate data and services widely, leading to a need for location-independent routing -- the ability to route queries directly to objects using names that are independent of the objects' physical locations. Two important properties of a routing infrastructure are routing locality and rapid adaptation to arriving and departing nodes. We show how these two properties can be achieved with an efficient solution to the nearest-neighbor problem. We present a new distributed algorithm that can solve the nearest-neighbor problem for a restricted metric space. We describe our solution in the context of Tapestry, an overlay network infrastructure that employs techniques proposed by Plaxton, Rajaraman, and Richa.

[ Paper: PDF (205K), Postscript (266K), Compressed Post Script (91K) ]

Last modified on 04/22/2002 by Ben Y. Zhao.