ACM Home Page
Please provide us with feedback. Feedback
OpenDHT: a public DHT service and its uses
Full text PdfPdf (536 KB)
Source Applications, Technologies, Architectures, and Protocols for Computer Communication archive
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications table of contents
Philadelphia, Pennsylvania, USA
SESSION: DHT table of contents
Pages: 73 - 84  
Year of Publication: 2005
ISBN:1-59593-009-4
Also published in ...
Authors
Sean Rhea  UC Berkeley and Intel Research
Brighten Godfrey  UC Berkeley and Intel Research
Brad Karp  UC Berkeley and Intel Research
John Kubiatowicz  UC Berkeley and Intel Research
Sylvia Ratnasamy  UC Berkeley and Intel Research
Scott Shenker  UC Berkeley and Intel Research
Ion Stoica  UC Berkeley and Intel Research
Harlan Yu  UC Berkeley and Intel Research
Sponsors
SIGCOMM: ACM Special Interest Group on Data Communication
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 168,   Citation Count: 43
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1080091.1080102
What is a DOI?

ABSTRACT

Large-scale distributed systems are hard to deploy, and distributed hash tables (DHTs) are no exception. To lower the barriers facing DHT-based applications, we have created a public DHT service called OpenDHT. Designing a DHT that can be widely shared, both among mutually untrusting clients and among a variety of applications, poses two distinct challenges. First, there must be adequate control over storage allocation so that greedy or malicious clients do not use more than their fair share. Second, the interface to the DHT should make it easy to write simple clients, yet be sufficiently general to meet a broad spectrum of application requirements. In this paper we describe our solutions to these design challenges. We also report our early deployment experience with OpenDHT and describe the variety of applications already using the system.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Bamboo. http://bamboo-dht.org/.
 
2
Chord. http://www.pdos.lcs.mit.edu/chord/.
 
3
Pastry. http://freepastry.rice.edu/.
 
4
H. Balakrishnan, S. Shenker, and M. Walfish. Peering peer-to-peer providers. In IPTPS, Feb. 2005.
 
5
A. Bavier et al. Operating system support for planetary-scale network services. In NSDI, Mar. 2004.
6
7
 
8
J. Cates. Robust and efficient data management for a distributed hash table. Master's thesis, MIT, May 2003.
9
 
10
F. Dabek, J. Li, E. Sit, J. Robertson, M. F. Kaashoek, and R. Morris. Designing a DHT for low latency and high throughput. In NSDI, 2004.
 
11
F. Dabek, B. Zhao, P. Druschel, J. Kubiatowicz, and I. Stoica. Towards a common API for structured P2P overlays. In IPTPS, 2003.
12
 
13
14
 
15
M. J. Freedman, E. Freudenthal, and D. Mazières. Democratizing content publication with Coral. In NSDI, Mar. 2004.
16
 
17
R. Huebsch, J. M. Hellerstein, N. Lanham, B. T. Loo, S. Shenker, and I. Stoica. Querying the Internet with PIER. In VLDB, 2003.
 
18
D. R. Karger and M. Ruhl. Diminished Chord: A protocol for heterogeneous subgroup formation in peer-to-peer networks. In IPTPS, 2004.
 
19
B. Karp, S. Ratnasamy, S. Rhea, and S. Shenker. Spurring adoption of DHTs with OpenHash, a public DHT service. In IPTPS, 2004.
 
20
A. Mislove et al. POST: a secure, resilient, cooperative messaging system. In HotOS, 2003.
 
21
R. Moskowitz, P. Nikander, P. Jokela, and T. Henderson. Host identity protocol (work in progress). IETF Internet Draft, 2004.
 
22
A. Muthitacharoen, S. Gilbert, and R. Morris. Etna: A fault-tolerant algorithm for atomic mutable DHT data. Technical Report MIT-LCS-TR-993, MIT-LCS, June 2005.
23
24
25
26
 
27
 
28
 
29
S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz. Handling churn in a DHT. In USENIX Annual Tech. Conf., June 2004.
 
30
T. Roscoe and S. Hand. Palimpsest: Soft-capacity storage for planetary-scale services. In HotOS, May 2003.
31
 
32
J. Stribling. Planetlab all-pairs ping. http://www.pdos.lcs.mit.edu/~strib/pl_app/APP_README.txt.
 
33
M. Walfish, H. Balakrishnan, and S. Shenker. Untangling the Web from DNS. In NSDI, Mar. 2004.
 
34
B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. D. Kubiatowicz. Tapestry: A resilient global-scale overlay for service deployment. IEEE JSAC, 22(1):41--53, Jan. 2004.
35

CITED BY  44

Collaborative Colleagues:
Sean Rhea: colleagues
Brighten Godfrey: colleagues
Brad Karp: colleagues
John Kubiatowicz: colleagues
Sylvia Ratnasamy: colleagues
Scott Shenker: colleagues
Ion Stoica: colleagues
Harlan Yu: colleagues