ACM Home Page
Please provide us with feedback. Feedback
Wide-area cooperative storage with CFS
Full text PdfPdf (1.25 MB)
Source ACM Symposium on Operating Systems Principles archive
Proceedings of the eighteenth ACM symposium on Operating systems principles table of contents
Banff, Alberta, Canada
SESSION: File systems table of contents
Pages: 202 - 215  
Year of Publication: 2001
ISBN:1-58113-389-8
Also published in ...
Authors
Frank Dabek  MIT Laboratory for Computer Science
M. Frans Kaashoek  MIT Laboratory for Computer Science
David Karger  MIT Laboratory for Computer Science
Robert Morris  MIT Laboratory for Computer Science
Ion Stoica  University of California, Berkeley
Sponsor
SIGOPS: ACM Special Interest Group on Operating Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 22,   Downloads (12 Months): 201,   Citation Count: 229
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/502034.502054
What is a DOI?

ABSTRACT

The Cooperative File System (CFS) is a new peer-to-peer read-only storage system that provides provable guarantees for the efficiency, robustness, and load-balance of file storage and retrieval. CFS does this with a completely decentralized architecture that can scale to large systems. CFS servers provide a distributed hash table (DHash) for block storage. CFS clients interpret DHash blocks as a file system. DHash distributes and caches blocks at a fine granularity to achieve load balance, uses replication for robustness, and decreases latency with server selection. DHash finds blocks using the Chord location protocol, which operates in time logarithmic in the number of servers.CFS is implemented using the SFS file system toolkit and runs on Linux, OpenBSD, and FreeBSD. Experience on a globally deployed prototype shows that CFS delivers data to clients as fast as FTP. Controlled tests show that CFS is scalable: with 4,096 servers, looking up a block of data involves contacting only seven servers. The tests also demonstrate nearly perfect robustness and unimpaired performance even when as many as half the servers fail.


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
Akamai Technologies, Inc. http://www.akamai.com/, 2001. Cambridge, MA.
2
 
3
CHANKHUNTHOD, A., DANZIG, P., NEERDAELS, C., SCHWARTZ, M., AND WORRELL, K. k hierarchical lntemet object cache. In Proc. Usenix Technical Conference (Jan. 1996), pp. 153-163.
4
 
5
CLARKE, I. A distributed decentralised information storage and retrieval system. Master's thesis, University of Edinburgh, 1999.
 
6
 
7
 
8
FAN, L., CAO, P., ALMEIDA, J., AND BRODER, A. Summary cache: a scalable wide-area web-cache sharing protocol. Tech. Rep. 1361, Computer Science Department, University of Wisconsin, Madison, Feb. 1998.
 
9
FU, K., KAASHOEK, i . F., AND MAZIERES, D. Fast and secure distributed read-only file system. In Proceedings of the 4th USENIX Symposium on Operating Systems Design and Implementation (OSDI) (October 2000), pp. 181-196.
 
10
GADDE, S., CHASE, J., AND RABINOVICH, i . A taste of crispy squid. In Workshop on lnternet Server Performance (June 1998), pp. 129-136.
 
11
Gnutella website, http://gnutella.wego.com.
12
13
 
14
LEWlN, D. Consistent hashing and random aces: Algorithms for caching in distributed networks. Master's thesis, MIT, 1998.
 
15
MALPANI, R., LURCH, J., AND BERGER, D. Making world wide web caching servers cooperate. In Fourth International World Wide Web Conference (1995), pp. 107-110.
 
16
17
 
18
 
19
Mojo nation documentation, http:l/www.mojonafion.neVducsL
 
20
Napster. http:/lwww.napster com.
 
21
 
22
Ohaha. http://www., ohaha, co:a/a,,s igu. him1, as of June 17, 2001, the Ohaha application is no longer available.
 
23
24
25
26
27
 
28
29
 
30
31
 
32
STOICA, I., MORRIS, R., KARGER, D., KAASHOEK, M. F., AND BALAKRISHNAN, H. Chord: A scalable peer-to-peer lookup service for interact applications. Tech. Rep. TR-819, MIT, Cambridge, MA, March 2001.
 
33
TYAN, T. A case study of server selection. Master's thesis, MtT, Sept. 2001.
 
34
WALDMAN, M., ROBIN, A., AND CRANOR, L. F. Publius: A robust, tamper-evident, censorship-resistant, web publishing system. In Proc. 9th USENIX Security Symposium (August 2000), pp. 59-72.
 
35

CITED BY  229

Collaborative Colleagues:
Frank Dabek: colleagues
M. Frans Kaashoek: colleagues
David Karger: colleagues
Robert Morris: colleagues
Ion Stoica: colleagues