| Alternate document: Details Distributed Object Location in a Dynamic Network (02) Kirsten Hildrum, John D. Kubiatowicz, Satish Rao, Ben Y. Zhao |
| Alternate document: Details Distributed Object Location in a Dynamic Network (02) Kirsten Hildrum, John Kubiatowicz, Satish Rao and Ben Y. Zhao |
Kirsten Hildrum, John D. Kubiatowicz, Satish Rao, Ben Y. Zhao  Home/Search
Context Related
| berkeley.edu/publi...tapestrytr.ps.gz berkeley.edu/techrepor...CSD021178.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: berkeley.edu/publications/ (more) Homepages: J.Kubiatowicz B.Zhao |
Rate this article:      (best)Comment on this article |
Abstract: Modern networking applications replicate data and services widely, leading to a need for locationindependent 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... (Update)
Cited by: More
Active and Concurrent Topology Maintenance - Xiaozhou Li Jayadev (Correct)
Concurrent Maintenance of Rings - Xiaozhou Li Jayadev (Correct)
On Name Resolution in Peer-to-Peer Networks - Xiaozhou Li Greg (Correct)
Similar documents (at the sentence level): More
76.9%: Distributed Data Location in a Dynamic Network - Hildrum, Kubiatowicz, Rao, Zhao (2002) (Correct)
33.5%: Distributed Object Location in a Dynamic Network - Hildrum, Kubiatowicz, Rao, Zhao (2002) (Correct)
8.5%: Finding Nearby Objects in Peer-to-Peer Networks - Hildrum (2004) (Correct)
Active bibliography (related documents): More All
0.0: CS 273: Kris Hildrum Notes - Scribe David Garmire (Correct)
0.0: Compact Roundtrip Routing for Digraphs - Cowen, Wagner (1999) (Correct)
0.0: Compact Routing with Minimum Stretch - Cowen (Correct)
Similar documents based on text: More All
0.9: Tapestry: A Resilient Global-scale Overlay for.. - Zhao, Huang.. (2003) (Correct)
0.9: Tapestry: An Infrastructure for Fault-tolerant Wide-area .. - Zhao, Kubiatowicz.. (2001) (Correct)
0.9: Neighbor Table Construction and Update In a Dynamic Peer-To-Peer .. - Liu, Lam (2002) (Correct)
Related documents from co-citation: More All
15: Chord: A scalable peer-to-peer lookup service for Internet applications - Stoica, Morris et al. - 2001
11: A scalable content-addressable network - Ratnasamy, Francis et al. - 2001
11: OceanStore: An Architecture for Global-Scale Persistent Storage - Kubiatowicz - 2000
BibTeX entry: (Update)
K. Hildrum, J. Kubiatowicz, S. Rao, and B. Zhao. Distributed data location in a dynamic network. In Proc. of ACM SPAA, 2002. http://citeseer.ist.psu.edu/hildrum02distributed.html More
@techreport{ dynamictapestry,
author = "Kirsten Hildrum and John D. Kubiatowicz and Satish Rao and Ben Zhao",
title = "Distributed Data Location in a Dynamic Network",
institituion = "University of California, Berkeley",
year = "2002",
number = "UCB/CSD-02-1178",
month = Apr,
note = "Updated version to appear in SPAA 2002",
url = "citeseer.ist.psu.edu/hildrum02distributed.html" }
Citations (may not include all citations):1023 A scalable content-addressable network - RATNASAMY, FRANCIS et al. - 2001
477 distributed object location and routing for large-scale peer.. (context) - DRUSCHEL, ROWSTRON - 2001
449 OceanStore: An architecture for global-scale persistent stor.. - KUBIATOWICZ, BINDEL et al. - 2000
411 Freenet: A distributed anonymous information storage and ret.. - CLARKE, SANDBERG et al. - 2001
282 Accessing nearby copies of replicated objects in a distribut.. - PLAXTON, RAJARAMAN et al. - 1997
116 Feasibility of a serverless distributed file system deployed.. (context) - BOLOSKY, DOUCEUR et al. - 2000
96 Concurrent online tracking of mobile users - AWERBUCH, PELEG - 1991
66 On lipschitz embedding of finite metric spaces in hilbert sp.. (context) - BOURGAIN - 1985
64 Routing with polynomial communication-space trade-off - AWERBUCH, PELEG - 1992
53 Nearest neighbor queries in metric spaces (context) - CLARKSON - 1997
33 Integrating content-based access mechanisms with hierarchica.. - GOPAL, MANBER - 1999
28 Routing in distributed networks: Overview and open problems - GAVOILLE - 2001
26 A tradeoff between size and efficiency for routing tables (context) - PELEG, UPFAL - 1989
18 Past: Persistent and anonymous storage in a peer-to-peer net.. (context) - DRUSCHEL, ROWSTRON - 2001
13 Harnessing the Power of Disruptive Technologies (context) - ORAM - 2001
12 Find nearest neighbors in growth-restricted metrics (context) - KARGER, RUHL - 2002
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://oceanstore.cs.berkeley.edu/publications/): More
OceanStore: An Extremely Wide-Area Storage System - Bindel, Chen, Eaton, Geels, .. (2000) (Correct)
OceanStore: An Extremely Wide-Area Storage System - Bindel, Chen, Eaton, Geels, .. (2000) (Correct)
The OceanStore Archive: Goals, Structures, and Self-Repair - Wells (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC