See this document in CiteSeerX!

Handling Churn in a DHT (2003)  (Make Corrections)  (59 citations)
Sean Rhea, Dennis Geels, Timothy Roscoe, John Kubiatowicz



  Home/Search   Context   Related

 
View or download:
berkeley.edu/public...csd031299.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  berkeley.edu/publications/ (more)
(Enter author homepages)

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

Abstract: This paper addresses the problem of churn---the continuous process of node arrival and departure---in distributed hash tables (DHTs). We demonstrate through experiment that existing DHT implementations break down at churn levels observed in deployed peer-to-peer systems, contrary to simulation-based results. We present Bamboo, a DHT that handles high levels of churn, and discuss the manner in which it does so. We show that Bamboo is able to function effectively for median node session times as... (Update)

Cited by:   More
Proactive Replication for Data Durability - Emil Sit Andreas (2006)   (Correct)
Appears in Proceedings of the Fourth IEEE.. - Improving Bandwidth..   (Correct)
OpenDHT: A Public DHT Service and Its Uses - Sean Rhea Brighten (2005)   (Correct)

Active bibliography (related documents):   More   All
0.7:   Sean Rhea, Dennis Geels, Timothy Roscoe, and John Kubiatowicz - Report No Ucb   (Correct)
0.7:   Handling Churn in DHT - Rhea, Geels, Roscoe, Kubiatowicz (2003)   (Correct)
0.2:   Handling Churn in a DHT - Rhea, Geels, Roscoe, Kubiatowicz (2004)   (Correct)

Similar documents based on text:   More   All
0.4:   OceanStore: An Architecture for Global-Scale.. - Kubiatowicz, Bindel, .. (2000)   (Correct)
0.3:   OceanStore: An Extremely Wide-Area Storage System - Bindel, Chen, Eaton, Geels, .. (2000)   (Correct)
0.2:   Pond: the OceanStore Prototype - Rhea, Eaton, Geels, Weatherspoon.. (2003)   (Correct)

Related documents from co-citation:   More   All
27:   Chord: A scalable peer-to-peer lookup service for Internet applications - Stoica, Morris et al. - 2001
18:   A scalable content-addressable network - Ratnasamy, Francis et al. - 2001
18:   Wide-area cooperative storage with CFS - DABEK, KAASHOEK et al. - 2001

BibTeX entry:   (Update)

S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz. Handling churn in a dht. In Proc. of USENIX Technical Conference, June 2004. http://citeseer.ist.psu.edu/rhea03handling.html   More

@misc{ rhea04handling,
  author = "S. Rhea and D. Geels and T. Roscoe and J. Kubiatowicz",
  title = "Handling churn in a dht",
  text = "S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz. Handling churn in a dht.
    In Proc. of USENIX Technical Conference, June 2004.",
  year = "2004",
  url = "citeseer.ist.psu.edu/rhea03handling.html" }
Citations (may not include all citations):
1225   Chord: A scalable peer-to-peer lookup service for Internet a.. - Stoica, Morris et al. - 2001
1023   A scalable content-addressable network - Ratnasamy, Francis et al. - 2001  ACM   DBLP
477   distributed object location and routing for large scale peer.. (context) - Rowstron, Druschel et al. - 2001
458   Tapestry: An infrastructure for fault-tolerant wide-area loc.. - Zhao, Joseph et al. - 2001
338   A measurement study of peer-to-peer file sharing systems - Saroiu, Gummadi et al. - 2002
282   Accessing nearby copies of replicated objects in a distribut.. - Plaxton, Rajaraman et al. - 1997  ACM   DBLP
262   Epidemic algorithms for replicated database maintenance (context) - Demers, Greene et al. - 1987  ACM   DBLP
130   A Quantitative Comparison of Graph-based Models for Internet.. - Zegura, Calvert et al. - 1997  ACM   DBLP
120   Kademlia: A peer-to-peer information system based on the XOR.. - Maymounkov, Mazieres - 2002
93   The impact of DHT routing geometry on resilience and proximi.. - Gummadi, Gummadi et al. - 2003  ACM
79   Exploiting network proximity in peer-to-peer overlay network.. (context) - Castro, Druschel et al. - 2002
63   Understanding availability - Bhagwan, Savage et al. - 2003  DBLP
57   and analysis of a peerto -peer file-sharing workload (context) - Gummadi, Dunn et al. - 2003
57   Brocade: Landmark Routing on Overlay Networks - Zhao, Duan et al. - 2002  DBLP
47   Scalability and accuracy in a large-scale network emulator - Vahdat, Yocum et al. - 2002  ACM   DBLP
45   Analysis of the evolution of peer-to-peer systems (context) - Liben-Nowell, Balakrishnan et al. - 2002  ACM   DBLP
41   Analyzing peer-to-peer traffic across large networks - Sen, Wang - 2002  ACM
39   Availability and locality measurements of peer-to-peer file .. - Chu, Labonte et al. - 2002
32   dynamic peer networks: Pick two (context) - Blake, Rodrigues et al. - 2003
29   Datagram congestion control protocol (context) - Kohler, Handley et al. - 2003
26   Controlling the cost of reliability in peer-to-peer overlays - Mahajan, Castro et al. - 2003
11   Learning Euclidean coordinates for Internet hosts (context) - Cox, Dabek - 2002
11   On spreading a rumor (context) - Pittel - 1987  ACM
11   Robust and efficient data management for a distributed hash .. - Cates - 2003
6   Building a flexible and efficient routing infrastructure: Ne.. (context) - Lakshminarayanan, Stoica et al. - 2003



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