See this document in CiteSeerX!

Comparing the performance of distributed hash tables under churn (2004)  (Make Corrections)  (16 citations)
Jinyang Li, Jeremy Stribling, Thomer M. Gil, Robert Morris, M. Frans Kaashoek ...



  Home/Search   Context   Related

 
View or download:
mit.edu/~strib/doc...parisoniptps04.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  mit.edu/~strib/papers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: A protocol for a distributed hash table (DHT) incurs communication costs to keep up with churn---changes in membership---in order to maintain its ability to route lookups efficiently. This paper formulates a unified framework for evaluating cost and performance. Communication costs are combined into a single cost measure (bytes), and performance benefits are reduced to a single latency measure. This approach correctly accounts for background maintenance traffic and timeouts during lookup due to ... (Update)

Cited by:   More
D1HT: A Distributed One Hop Hash Table - And   (Correct)
Implementing Declarative Overlays - Boon Thau Loo (2005)   (Correct)
Performance and Dependability of Structured Peer-to-Peer.. - Miguel Castro Manuel (2004)   (Correct)

Active bibliography (related documents):   More   All
1.2:   Comparing the Performance of Distributed Hash Tables Under Churn - Jinyang Li Jeremy (2004)   (Correct)
0.4:   Designing a DHT for low latency and high throughput - Frank Dabek Jinyang (2004)   (Correct)
0.3:   Examining the Tradeoffs of Structured Overlays in a Dynamic .. - Gerding, Stribling (2003)   (Correct)

Similar documents based on text:   More   All
0.4:   The Click Modular Router - Kohler (2000)   (Correct)
0.4:   MULTOPS: a data structure for denial-of-service attack detection - Gil (2000)   (Correct)
0.3:   Eddie Kohler - Technology Square Room   (Correct)

Related documents from co-citation:   More   All
11:   Chord: A scalable peer-to-peer lookup service for Internet applications - Stoica, Morris et al. - 2001
9:   A Measurement Study of Peer-to-Peer File Sharing Systems - Saroiu, Gummadi et al. - 2002
8:   Handling churn in a dht - Rhea, Geels et al. - 2004

BibTeX entry:   (Update)

J. Li, J. Stribling, T. M. Gil, R. Morris, and F. Kaashoek. Comparing the performance of distributed hash tables under churn. In Proc. IPTPS, 2004. http://citeseer.ist.psu.edu/article/li04comparing.html   More

@misc{ li04comparing,
  author = "J. Li and J. Stribling and T. Gil and R. Morris and F. Kaashoek",
  title = "Comparing the performance of distributed hash tables under churn",
  text = "J. Li, J. Stribling, T. M. Gil, R. Morris, and F. Kaashoek. Comparing the
    performance of distributed hash tables under churn. In Proc. IPTPS, 2004.",
  year = "2004",
  url = "citeseer.ist.psu.edu/article/li04comparing.html" }
Citations (may not include all citations):
120   Kademlia: A peer-to-peer information system based on the XOR.. - Maymounkov, Mazieres - 2002  DBLP
93   The impact of DHT routing geometry on resilience and proximi.. - Gummadi, Gummadi et al. - 2003  ACM
80   Chord: A scalable peer-to-peer lookup protocol for Internet .. - Stoica, Morris et al. - 2002  DBLP
79   Tapestry: A resilient global-scale overlay for service deplo.. - Zhao, Huang et al. - 2004
53   King: Estimating latency between arbitrary Internet end host.. - Gummadi, Saroiu et al. - 2002
46   Koorde: A simple degreeoptimal hash table (context) - Kaashoek, Karger - 2003
26   One hop lookups for peer-to-peer overlays - Gupta, Liskov et al. - 2003
22   Kelip Building efficient and stable PP DHT through increased.. - Ken, Linga et al. - 2003
15   Analysis of the evolution of peer-to-peer systems - Liben-Nowell, Balakrishnan et al. - 2002  ACM   DBLP
13   Structured peerto -peer overlays need application-driven ben.. - Rhea, Roscoe et al. - 2003
13   Performance and dependability of structured peer-to-peer ove.. - Castro, Costa et al. - 2003  ACM
8   the fundamental tradeoffs between routing table size and net.. - Xu - 2003
5   Viceroy: A scalable dynamic emulation of the butterfly (context) - Malkhi, Naor et al. - 2002
5   Computer Science Division (context) - Rhea, Geels et al. - 2003
3   A measurement study of Napster and Gnutella as examples of p.. - Gummadi, Saroiu et al. - 2003  ACM



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://pdos.lcs.mit.edu/~strib/papers.html):   More
Exploiting Routing Redundancy via Structured.. - Zhao, Huang.. (2003)   (Correct)
Brief Announcement: Stretch Between Nearby Peers - Hildrum, Kubiatowicz, Stribling (2004)   (Correct)
Tapestry: A Resilient Global-Scale Overlay for.. - Zhao, Huang.. (2004)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC