Frank Dabek, Jinyang Li, Emil Sit, James Robertson, M. Frans Kaashoek, Robert ...  Home/Search
Context Related
| projectiris.net/irisbib/pa...paper.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: projectiris.net/irisbib/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Designing a wide-area distributed hash table (DHT) that provides high-throughput and low-latency network storage is a challenge. Existing systems have explored a range of solutions, including iterative routing, recursive routing, proximity routing and neighbor selection, erasure coding, replication, and server selection. (Update)
Cited by: More
Proactive Replication for Data Durability - Emil Sit Andreas (2006) (Correct)
Heterogeneity and Load Balance - In Distributed Hash (Correct)
OpenDHT: A Public DHT Service and Its Uses - Sean Rhea Brighten (2005) (Correct)
Active bibliography (related documents): More All
2.2: Designing a DHT for low latency and high throughput - Frank Dabek Jinyang (2004) (Correct)
0.4: Comparing the Performance of Distributed Hash Tables Under Churn - Jinyang Li Jeremy (2004) (Correct)
0.3: Examining the Tradeoffs of Structured Overlays in a Dynamic .. - Gerding, Stribling (2003) (Correct)
Similar documents based on text:
4.0: Unknown - (Correct)
Related documents from co-citation: More All
21: Wide-area cooperative storage with CFS - DABEK, KAASHOEK et al. - 2001
20: Chord: A scalable peer-to-peer lookup service for Internet applications - Stoica, Morris et al. - 2001
14: distributed object location and routing for large-scale peer-to-peer systems (context) - Rowstron, Druschel et al. - 2001
BibTeX entry: (Update)
F. Dabek, J. Li, E. Sit, J. Robertson, M. Frans Kaashoek, and R. Morris. Designing a DHT for low latency and high throughput. In Proceedings of the USENIX Symposium on Networked Systems Design and Implementation, March 2004. http://citeseer.ist.psu.edu/dabek04designing.html More
@misc{ dabek04designing,
author = "F. Dabek and J. Li and E. Sit and J. Robertson and M. Kaashoek and R. Morris",
title = "Designing a DHT for low latency and high throughput",
text = "F. Dabek, J. Li, E. Sit, J. Robertson, M. Frans Kaashoek, and R. Morris.
Designing a DHT for low latency and high throughput. In Proceedings of the
USENIX Symposium on Networked Systems Design and Implementation, March 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/dabek04designing.html" }
Citations (may not include all citations):1330 Congestion avoidance and control - JACOBSON - 1988
1225 Chord: A scalable peer-to-peer lookup service for Internet a.. - STOICA, MORRIS et al. - 2001 DBLP
477 distributed object location and routing for large-scale peer.. (context) - ROWSTRON, DRUSCHEL - 2001
449 OceanStore: An architecture for global-scale persistent stor.. - KUBIATOWICZ, BINDEL et al. - 2000
342 Wide-area cooperative storage with CFS - DABEK, KAASHOEK et al. - 2001 ACM DBLP
307 Resilient overlay networks - ANDERSEN, BALAKRISHNAN et al. - 2001 ACM DBLP
280 persistent peer-to-peer storage utility (context) - ROWSTRON, DRUSCHEL et al. - 2001
246 Analysis of the increase and decrease algorithms for congest.. (context) - CHIU, JAIN - 1989 ACM DBLP
163 Efficient dispersal of information for security (context) - RABIN - 1989
154 A blueprint for introducing disruptive technology into the I.. - PETERSON, ANDERSON et al. - 2002
120 Kademlia: A peer-topeer information system based on the XOR .. - MAYMOUNKOV, MAZIERES - 2002
117 Topologically-aware overlay construction and server selectio.. - RATNASAMY, HANDLEY et al. - 2002 DBLP
110 The eternity service - ANDERSON - 1996
105 Predicting Internet network distance with coordinates-based .. - NG, ZHANG - 2002 DBLP
93 The impact of DHT routing geometry on resilience and proximi.. - GUMMADI, GUMMADI et al. - 2003 ACM
85 and reliable storage for an incompletely trusted environment (context) - ADYA, BOLOSKY et al. - 2002
79 Exploiting network proximity in peer-to-peer overlay network.. (context) - CASTRO, DRUSCHEL et al. - 2002
79 Tapestry: A resilient globalscale overlay for service deploy.. - ZHAO, HUANG et al. - 2004
77 A prototype implementation of archival intermemory - CHEN, EDLER et al. - 1999 ACM DBLP
74 Ivy readwrite peer to peer file system - GIL, read et al. - 2002
63 Understanding availability - BHAGWAN, VOELKER - 2003 DBLP
53 King: Estimating latency between arbitrary Internet end host.. - GUMMADI, SAROIU et al. - 2002
51 Pond: the OceanStore prototype - RHEA, EATON et al. - 2003 DBLP
40 replication: A quantitative comparison (context) - WEATHERSPOON, KUBIATOWICZ - 2002
37 Pastiche: making backup cheap and easy - COX, NOBLE - 2002 DBLP
32 dynamic peer networks: Pick two (context) - BLAKE, RODRIGUES - 2003
30 Mnemosyne: Peer-to-peer steganographic storage - HAND, ROSCOE - 2001 DBLP
30 Lighthouses for scalable distributed location - PIAS, CROWCROFT et al. - 2003 DBLP
26 One hop lookups for peer-to-peer overlays - GUPTA, LISKOV et al. - 2003
23 peer-to-peer web cache (context) - IYER, ROWSTRON et al. - 2002
22 Kelip Building efficient and stable PP DHT through increased.. - LINGA, VAN RENESSE et al. - 2003
22 Big-bang simulation for embedding network distances in Eucli.. - SHAVITT, TANKEL - 2003 DBLP
20 Untangling the web from DNS - WALFISH, BALAKRISHNAN et al. - 2004
14 distributed network coordinates (context) - COX, DABEK et al. - 2003
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
12 PIC: Practical Internet coordinates for distance estimation - COSTA, CASTRO et al. - 2004
12 Constructing an Internet coordinate system based on delay me.. - LIM, HOU et al. - 2003
11 Robust and efficient data management for a distributed hash .. - CATES - 2003
10 An epidemic protocol for managing routing tables in very lar.. - VOULGARIS, VAN STEEN - 2003 DBLP
7 Optimizations for locality-aware structured peerto -peer ove.. - STRIBLING - 2003
5 UsenetDHT: A low overhead usenet server - SIT, DABEK et al. - 2004
5 DHT routing tradeoffs in networks with churn (context) - LI, STRIBLING et al. - 2004
5 Computer Science Division (context) - RHEA, GEELS et al. - 2003
3 HiSCAMP: self-organising hierarchical membership protocol (context) - GANESH, KERMARREC et al. - 2002
http://www.overnet.com/
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://project-iris.net/irisbib/): More
OASIS: Anycast for Any Service - Michael Freedman Karthik (2006) (Correct)
Comparing the Performance of Distributed Hash Tables Under Churn - Jinyang Li Jeremy (2004) (Correct)
Minimizing Churn in Distributed Systems - Brighten Godfrey Scott (2006) (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