• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Handling Churn in a DHT (2004)

Cached

  • Download as a PDF

Download Links

  • [oceanstore.cs.berkeley.edu]
  • [srhea.net]
  • [www.srhea.net]
  • [www.cs.princeton.edu]
  • [www.csl.mtu.edu]
  • [www.oceanstore.org]
  • [oceanstore.net]
  • [oceanstore.cs.berkeley.edu]
  • [oceanstore.cs.berkeley.edu]
  • [www.ssrc.ucsc.edu]
  • [iris.csail.mit.edu]
  • [static.usenix.org]
  • [static.usenix.org]
  • [iris.lcs.mit.edu]
  • [www.usenix.org]
  • [www.usenix.org]
  • [www.usenix.org]
  • [iris.csail.mit.edu]
  • [people.inf.ethz.ch]
  • [www.inf.ethz.ch]
  • [oceanstore.cs.berkeley.edu]
  • [www.eecs.berkeley.edu]
  • [srhea.net]
  • [www.srhea.net]
  • [pompone.cs.ucsb.edu]
  • [sahara.cs.berkeley.edu]
  • [www.oceanstore.org]
  • [oceanstore.net]
  • [pompone.cs.ucsb.edu]

  • 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:449 - 22 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

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}
}

Share

Facebook Twitter Reddit Bibsonomy

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.

Keyphrases

churn rate    continuous process    message timeout calculation    distributed hash table    proximity neighbor selection    node arrival    mature dht implementation    current dht implementation    reactive versus periodic failure recovery    simulationbased dht study    modelnet network emulator    maintenance bandwidth    dht performance    packet loss    careful attention    deployed p2p system    emulated network    dht implementation    model in-network queuing    p2p file-sharing application   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

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

© 2007-2019 The Pennsylvania State University