See this document in CiteSeerX!

LAND: Locality Aware Networks for Distributed Hash Tables (2003)  (Make Corrections)  (11 citations)
Ittai Abraham, Dahlia Malkhi and Oren Dobzinski The Hebrew University of...



  Home/Search   Context   Related

 
View or download:
cmu.edu/~odobzins/pubs/LANDTR.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cmu.edu/~odobzins/publications (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: This paper proposes the first peer-to-peer network and lookup algorithm that has worst case constant distortion. The construction uses a constant expected number of links. The design lends itself to dynamic deployment, and has a simple and easy to verify proof. The construction embraces the two-tier architecture of current peer-to-peer networks, where stronger and stable nodes serve as ultra-peers, and other (e.g., transient home users) are regular peers. (Update)

Cited by:   More
Another Way to Find the Nearest Neighbor in.. - Hildrum, Kubiatowicz.. (2003)   (Correct)
Report No. UCB/CSD-03-1266 - Computer Science Division   (Correct)
LAND: Stretch (1 + ε) Locality-Aware Networks for.. - Abraham, Malkhi, Dobzinski   (Correct)

Active bibliography (related documents):   More   All
0.8:   LAND: Locality Aware Networks for Distributed Hash Tables - Dahlia (2003)   (Correct)
0.3:   Improved Lookup Algorithms for Viceroy - Dobzinski, Talmy (2004)   (Correct)
0.2:   On Zone-Balancing of Peer-to-Peer Networks: Analysis of.. - Wang, Zhang, Li.. (2004)   (Correct)

Similar documents based on text:   More   All
0.5:   Principles of Locality-Aware Networks for Locating Nearest.. - Abraham, Malkhi (2003)   (Correct)
0.4:   Principles of Locality-Aware Networks - For Locating Nearest   (Correct)
0.4:   Probabilistic Quorums for Dynamic Systems - Abraham, Malkhi (2003)   (Correct)

Related documents from co-citation:   More   All
9:   distributed object location and routing for large-scale peer-to-peer systems (context) - Rowstron, Druschel et al. - 2001
7:   Accessing nearby copies of replicated objects in a distributed environment - Plaxton, Rajaram et al. - 1997
6:   Sloppy hashing and self-organizing clusters - Freedman, eres - 2003

BibTeX entry:   (Update)

ABRAHAM, I., MALKHI, D., AND DOBZINSKI, O. LAND: Locality aware networks for distributed hash tables. Tech. Rep. TR 2003-75, Leibnitz Center, The Hebrew University, June 2003. http://citeseer.ist.psu.edu/abraham03land.html   More

@misc{ abraham03land,
  author = "I. ABRAHAM and D. MALKHI and O. DOBZINSKI",
  title = "LAND: Locality aware networks for distributed hash tables",
  text = "ABRAHAM, I., MALKHI, D., AND DOBZINSKI, O. LAND: Locality aware networks
    for distributed hash tables. Tech. Rep. TR 2003-75, Leibnitz Center, The
    Hebrew University, June 2003.",
  year = "2003",
  url = "citeseer.ist.psu.edu/abraham03land.html" }
Citations (may not include all citations):
1225   Chord: A scalable peer-to-peer lookup service for Internet a.. - Stoica, Morrise et al. - 2001
1023   A scalable content-addressable network - Ratnasamy, Francis et al. - 2001
458   Tapestry: An infrastructure for fault-tolerant wide-area loc.. - Zhao, Kubiatowicz et al. - 2001
282   Accessing nearby copies of replicated objects in a distribut.. - Plaxton, Rajaram et al. - 1997
206   Consistent hashing and random trees: Distributed caching pro.. - Karger, Lehman et al. - 1997
128   Viceroy: A scalable and dynamic emulation of the Butterfly - Malkhi, Naor et al. - 2002
104   Pastry: Scalable, distributed object location and routing fo.. - Drushel, Rowstron - 2001
46   Koorde: A Simple Degree-optimal Hash Table (context) - Kaashoek, Karger - 2003
42   Symphony: Distributed Hashing In Small World - Manku, Bawa et al. - 2003
37   Finding Nearest Neighbors in Growth-restricted Metrics - Karger, Ruhl - 2002
25   On name resolution in peer-to-peer networks - Li, Plaxton - 2002
20   A Generic Scheme for Building Overlay Networks in Adversaria.. - Abraham, Awerbuch et al. - 2003
13   A Scalable Protocol for Content-Based Routing in Overlay Net.. - Chand, Felber - 2003
12   Novel Architectures for P2P Applications: the Continuous-Dis.. (context) - Naor, Wieder - 2003
10   The Content-Addressable Network D2B (context) - Fraigniaud, Gauron - 2003
10   Atomic data access in distributed hash tables (context) - Lynch, Malkhi et al. - 2002
4   Dynamic Lookup Networks: A position paper (context) - Malkhi - 2002



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.ece.cmu.edu/~odobzins/publications.html):   More
Improved Lookup Algorithms for Viceroy - Dobzinski, Talmy (2004)   (Correct)
LAND: Stretch (1 + ε) Locality-Aware Networks for.. - Abraham, Malkhi, Dobzinski   (Correct)
Viceroy - on the implementation of a Peer to Peer network - Dobzinski, Talmy (2003)   (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