Handling Churn in a DHT

Handling Churn in a DHT (2004)

Cached

Download Links

by Sean Rhea , Dennis Geels , Timothy Roscoe , John Kubiatowicz

Venue:	In Proceedings of the USENIX Annual Technical Conference
Citations:	314 - 23 self

BibTeX

@INPROCEEDINGS{Rhea04handlingchurn,
    author = {Sean Rhea and Dennis Geels and Timothy Roscoe and John Kubiatowicz},
    title = {Handling Churn in a DHT},
    booktitle = {In Proceedings of the USENIX Annual Technical Conference},
    year = {2004}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

This paper addresses the problem of churn---the continuous process of node arrival and departure---in distributed hash tables (DHTs). We argue that DHTs should perform lookups quickly and consistently under churn rates at least as high as those observed in deployed P2P systems such as Kazaa. We then show through experiments on an emulated network that current DHT implementations cannot handle such churn rates. Next, we identify and explore three factors affecting DHT performance under churn: reactive versus periodic failure recovery, message timeout calculation, and proximity neighbor selection. We work in the context of a mature DHT implementation called Bamboo, using the ModelNet network emulator, which models in-network queuing, cross-traffic, and packet loss. These factors are typically missing in earlier simulationbased DHT studies, and we show that careful attention to them in Bamboo's design allows it to function effectively at churn rates at or higher than that observed in P2P file-sharing applications, while using lower maintenance bandwidth than other DHT implementations.

Citations

3257	Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications - Stoica, Morris, et al. - 2001
2544	A Scalable Content-Addressable Network - Ratnasamy, Francis, et al. - 2001
2167	Congestion Avoidance and Control - Jacobson - 1988
1602	Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems - Rowstron, Druschel - 2001
990	A measurement study of peer-to-peer file sharing systems - Saroiu, Gummadi, et al. - 2001
978	Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing - Zhao, Kubiatowicz, et al. - 2001
825	Wide-area cooperative storage with CFS - Dabek, Kaashoek, et al. - 2001
653	Epidemic algorithms for replicated database maintenance - Demers, Greene, et al. - 1987
505	Kademlia: A Peer-to-peer Information System Based on the XOR Metric - Maymounkov, Mazières - 2002
450	Accessing nearby copies of replicated objects in a distributed environment - Plaxton, Rajaram, et al. - 1997
417	Tapestry: A resilient global-scale overlay for service deployment - Zhao, Huang, et al. - 2003
366	Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload - Gummadi, Dunn, et al. - 2003
285	Analyzing peer-to-peer traffic across large networks - Sen, Wang - 2002
261	Understanding Availability - Bhagwan, Savage, et al. - 2003
231	Scalability and Accuracy in a Large-Scale Network Emulator - Vahdat, Yocum, et al. - 2002
230	The Impact of DHT Routing Geometry on Resilience and Proximity - Gummadi, Gummadi, et al. - 2003
211	A quantitative comparison of graph-based models for Internet topology - Zegura, Calvert, et al. - 1997
183	Analysis of the Evolution of Peer-to-Peer Systems - Liben-Nowell, Balakrishnan, et al. - 2002
160	Distributed Object Location in a Dynamic Network - Hildrum, Kubiatowicz, et al. - 2002
149	Designing a DHT for low latency and high throughput - Dabek, Li, et al. - 2004
132	High Availability, Scalable Storage, Dynamic Peer Networks - Blake, Rodrigues - 2003
129	Availability and locality measurements of peer-to-peer file systems - CHU, LABONTE, et al. - 2002
126	An evaluation of Scalable Application-level Multicast Built using Peer-to-peer Overlays - Castro, Jones, et al.
125	Exploiting network proximity in peer-to-peer overlay networks - Castro, Druschel, et al. - 2002
115	On spreading a rumor - Pittel - 1987
87	Performance and dependability of structured peer-to-peer overlays - CASTRO, COSTA, et al. - 2004
80	Datagram Congestion Control Protocol (DCCP) Work in Progress (IETF Internet-Draft draft-ietf-dccp-spec06.txt), February 2004. 152 - Kohler, Handley, et al. - 1999
70	Brocade: landmark routing on overlay networks - Zhao, Duan, et al. - 2002
68	Controlling the cost of reliability in peer-to-peer overlays - MAHAJAN, CASTRO, et al. - 2003
67	The case for a hybrid P2P search infrastructure, The 3rd Int’l Workshop on Peer-to-Peer Systems - Loo, Huebsch, et al.
50	Comparing the performance of distributed hash tables under churn - LI, STRIBLING, et al.
39	Robust and Efficient Data Management for a Distributed Hash Table - Cates - 2003
10	Learning Euclidean coordinates for Internet hosts. www.pdos.lcs.mit.edu/˜rsc/6867.pdf - Cox, Dabek - 2002
8	Building a flexible and efficient routing infrastructure: Need and challenges - Lakshminarayanan, Stoica, et al. - 2003
1	Measurement, modeling, and analysis of a peerto -peer file-sharing workload - Gummadi, Dunn, et al. - 2003