|
USENIX 2004 Annual Technical Conference, General Track — Abstract
Awarded Best Paper!
Pp. 127–140 of the Proceedings
Handling Churn in a DHT
Sean Rhea and Dennis Geels, University of California, Berkeley; Timothy Roscoe, Intel
Research, Berkeley; John Kubiatowicz, University of California, Berkeley
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
simulation-based 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.
- View the full text of this paper in HTML and PDF.
The Proceedings are published as a collective work, © 2004 by the USENIX Association. All Rights Reserved. Rights to individual papers remain with the author or the author's employer. Permission is granted for the noncommercial reproduction of the complete work for educational or research purposes. USENIX acknowledges all trademarks within this paper.
- If you need the latest Adobe Acrobat Reader, you can download it from Adobe's site.
|
Need help? Use our Contacts page.
