OceanStore Papers


	The OceanStore Project Paper Abstract Distributed Object Location in a Dynamic Network Kris Hildrum, John D. Kubiatowicz, Satish Rao, and Ben Y. Zhao To appear in Theory of Computing Systems, March 2004

Modern networking applications replicate data and services widely, leading to a need for location-independent routingrouting locality and rapid adaptation to arriving and departing nodes. We show how these 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, Rajaraman, and Richa.

[ Paper: PDF (351K), Postscript (3.8M), Compressed PostScript (1.1M) ]

Last modified on 08/03/2004 by John Kubiatowicz.