Handling Churn in a DHT

Handling Churn in a DHT (2003)

Cached

Download Links

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

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

Versions

Version History

Metadata Version 4

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Handling Churn in a DHT	INFERENCE
AUTHOR NAME	Sean Rhea	user correction - Legacy Corrections
AUTHOR AFFIL	University of California, Berkeley and Intel Research, Berkeley	user correction - Legacy Corrections
AUTHOR NAME	Sean Rhea	user correction - Legacy Corrections
AUTHOR AFFIL	University of California, Berkeley and Intel Research, Berkeley	user correction - Legacy Corrections
AUTHOR NAME	Dennis Geels	user correction - Legacy Corrections
AUTHOR AFFIL	University of California, Berkeley and Intel Research, Berkeley	user correction - Legacy Corrections
AUTHOR NAME	Dennis Geels	user correction - Legacy Corrections
AUTHOR AFFIL	University of California, Berkeley and Intel Research, Berkeley	user correction - Legacy Corrections
AUTHOR NAME	Timothy Roscoe	user correction - Legacy Corrections
AUTHOR AFFIL	University of California, Berkeley and Intel Research, Berkeley	user correction - Legacy Corrections
AUTHOR NAME	Timothy Roscoe	user correction - Legacy Corrections
AUTHOR AFFIL	University of California, Berkeley and Intel Research, Berkeley	user correction - Legacy Corrections
AUTHOR NAME	John Kubiatowicz	user correction - Legacy Corrections
AUTHOR AFFIL	University of California, Berkeley and Intel Research, Berkeley	user correction - Legacy Corrections
AUTHOR NAME	John Kubiatowicz	user correction - Legacy Corrections
AUTHOR AFFIL	University of California, Berkeley and Intel Research, Berkeley	user correction - Legacy Corrections
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 short as 1.4 minutes, while using less than 900 bytes/s/node of maintenance bandwidth in a 1000-node system. This churn rate is faster than that observed in real file-sharing systems such as Gnutella, Kazaa, Napster, and Overnet. Since Bamboo's bandwidth usage scales logarithmically in the number of nodes, we expect this cost to remain within the reach of dialup modems even for very large systems. Moreover, in simulated networks without churn, Bamboo achieves lookup performance comparable with Pastry, an existing DHT with a similar structure.	user correction - Legacy Corrections
YEAR	2003	user correction - Legacy Corrections
VENUE	In Proceedings of the USENIX Annual Technical Conference	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
CITATIONS	27 found	ParsCit 1.0