Distributed Object Location in a Dynamic Network

Distributed Object Location in a Dynamic Network (2002)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Kirsten Hildrum , John D. Kubiatowicz , Satish Rao , Ben Y. Zhao

Venue:	in Proceedings of SPAA
Citations:	155 - 16 self

BibTeX

@INPROCEEDINGS{Hildrum02distributedobject,
    author = {Kirsten Hildrum and John D. Kubiatowicz and Satish Rao and Ben Y. Zhao},
    title = {Distributed Object Location in a Dynamic Network},
    booktitle = {in Proceedings of SPAA},
    year = {2002},
    pages = {41--52}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

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 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 efficiently achieved for certain network topologies. To do this, we present a new distributed algorithm that can solve the nearestneighbor 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 [16].

Citations

3028	H.: Chord: A scalable Peer-To-Peer lookup service for internet applications - Stoica, Morris, et al.
2353	A scalable content-addressable network - Ratnasamy, Francis, et al. - 2001
1503	Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems - Rowstron, Druschel - 2001
928	Tapestry: An infrastructure for fault-tolerant wide-area location and routing - Zhao, Kubiatowicz, et al. - 2001
880	The sybil attack - Douceur
847	Oceanstore: An architecture for global-scale persistent storage - Kubiatowicz, Bindel, et al. - 2000
773	Freenet: A distributed anonymous information storage and retrieval system - Clarke, Sandberg, et al. - 2000
607	Storage Management and Caching in Past, a Large-Scale, Persistent Peer-to-Peer Storage Utility - Rowstron, Druschel - 2001
594	How to model an internetwork - Zegura, Calvert, et al.
422	Accessing nearby copies of replicated objects in a distributed environment - Plaxton, Rajaraman, et al. - 1997
376	The geometry of graphs and some of its algorithmic applications - Linial, London, et al. - 1995
304	Secure routing for structured peer-to-peer overlay networks - Castro, Druschel, et al. - 2002
260	Viceroy: A Scalable and Dynamic Emulation of the Butterfly - Malkhi, Naor, et al. - 2002
257	Feasibility of a serverless distributed file system deployed on an existing set of desktop pcs - BOLOSKY, DOUCEUR, et al.
243	On Lipschitz embedding of finite metric spaces in Hilbert space - Bourgain - 1985
195	Concurrent Online Tracking of Mobile Users - Awerbuch, Peleg - 1991
154	Approximate distance oracles - Thorup, Zwick
149	Compact routing schemes - Thorup, Zwick
146	Security Considerations for Peer-to-Peer Distributed Hash Tables - Sit, Morris - 2002
123	Finding nearest neighbors in growth-restricted metrics - Karger, Ruhl
118	Exploiting Network Proximity in Peer-to-Peer Overlay Networks - Castro, Druschel, et al. - 2002
105	Navigating Nets: Simple Algorithms for Proximity Search - Krauthgamer, Lee - 2004
99	Nearest neighbor queries in metric spaces - Clarkson - 1999
90	Compact routing with minimum stretch - Cowen - 1999
82	Tapestry: A global-scale overlay for rapid service deployment - Zhao, Huang, et al. - 2004
66	Routing with polynomial communication-space trade-off - Awerbuch, Peleg - 1992
62	Integrating content-based access mechanisms with hierarchical file systems - GOPAL, MANBER - 1999
45	Routing in distributed networks: Overview and open problems - Gavoille
37	Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks - Hildrum, Kubiatowicz - 2003
37	A tradeoff between size and efficiency for routing tables - Peleg, Upfal - 1989
30	On Name Resolution in Peer-to-Peer Networks - Li, Plaxton - 2002
21	Past: Persistent and anonymous storage in a peer-to-peer networking environment. Submission to - DRUSCHEL, ROWSTRON - 2001
13	A data tracking scheme for general networks - Rajaraman, Richa, et al. - 2001
13	Locality-aware mechanisms for large-scale networks - Zhao, Joseph, et al. - 2002
8	Another Way to Find the Nearest Neighbor in Growth-Restricted Metrics - Hildrum, Kubiatowicz, et al. - 2003
8	A note on finding nearest neighbors in growthrestricted metrics - Hildrum, Kubiatowicz, et al. - 2001
6	Harnessing the Power of Disruptive Technologies - Peer-to-Peer - 2001
5	Optimizations for locality-aware structured peer-to-peer overlays - Stribling, Hildrum, et al. - 2003
4	Harnessing the Power of Disruptive Technologies. O'Reilly Books - Peer-to-Peer - 2001
3	table construction and update in a dynamic peer-to-peer network - Liu, Lam - 2003
3	OceanStore: An architecture forglobal-scale persistent storage - Kubiatowicz, Bindel, et al. - 2000
2	Security considerations for peerto -peer distributed hash tables - SIT, MORRIS - 2002
2	Concurrent online trackingof mobile users - AWERBUCH, PELEG - 1991
2	Integrating content-based ac-cess mechanisms with hierarchical file systems - OPAL, B, et al. - 1999
1	On name resolution in peerto -peer networks - LI, PLAXTON - 2002
1	On Lipschitz embedding of finite metricspaces in Hilbert space - BOURGAIN - 1985
1	Compact routing with minimum stretch. InProc. of the 10th Annual ACM-SIAM Symp. on Discrete Algorithms - OWEN, J - 1997
1	Neighbor table construction andupdate in a dynamic peer-to-peer network - LIU, LAM - 2001
1	Find nearest neighbors ingrowth-restricted metrics - UCBCSD-03-1267, Berkeley, et al. - 2002