• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Handling Churn in a DHT (2004)

Cached

  • Download as a PDF
    •  
  • Download as a PS

Download Links

  • [oceanstore.cs.berkeley.edu]
  • [srhea.net]
  • [www.srhea.net]
  • [oceanstore.cs.berkeley.edu]
  • [oceanstore.cs.berkeley.edu]
  • [www.ssrc.ucsc.edu]
  • [iris.csail.mit.edu]
  • [people.inf.ethz.ch]
  • [oceanstore.cs.berkeley.edu]
  • [www.eecs.berkeley.edu]
  • [srhea.net]
  • [www.srhea.net]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Sean Rhea , Dennis Geels , Timothy Roscoe , John Kubiatowicz
Venue:In Proceedings of the USENIX Annual Technical Conference
Citations:286 - 24 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

Versions

  • Version 0
  • Version 1
  • Version 2
  • Version 3

Version History

Metadata Version 3

User correction supplied by SystemCorrections

DatumValueSource
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 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 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 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. user correction - Legacy Corrections
YEAR 2004 INFERENCE
VENUE In Proceedings of the USENIX Annual Technical Conference INFERENCE
VENUE TYPE CONFERENCE INFERENCE
CITATIONS 27 found ParsCit 1.0
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University