%0 Conference Paper %1 Dabek01wide-areacooperative %A Dabek, Frank %A Kaashoek, M. Frans %A Karger, David %A Morris, Robert %A Stoica, Ion %D 2001 %K chord dht distributed filesystem %P 202--215 %T Wide-area cooperative storage with CFS %U http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.7153 %X The Cooperative File System (CFS) is a new peer-to-peer readonly 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. 1.

@inproceedings{Dabek01wide-areacooperative, abstract = {The Cooperative File System (CFS) is a new peer-to-peer readonly 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. 1. }, added-at = {2012-06-06T13:36:33.000+0200}, author = {Dabek, Frank and Kaashoek, M. Frans and Karger, David and Morris, Robert and Stoica, Ion}, biburl = {https://www.bibsonomy.org/bibtex/28b3fff486c18978a20739197aa8eba2b/evnu}, interhash = {4af18923c02c723515a67134ed1d4e7d}, intrahash = {8b3fff486c18978a20739197aa8eba2b}, keywords = {chord dht distributed filesystem}, pages = {202--215}, timestamp = {2012-06-06T13:36:33.000+0200}, title = {Wide-area cooperative storage with CFS}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.7153}, year = 2001 }