Wide-area cooperative storage with CFS

  • Authors:
  • Frank Dabek;M. Frans Kaashoek;David Karger;Robert Morris;Ion Stoica

  • Affiliations:
  • MIT Laboratory for Computer Science;MIT Laboratory for Computer Science;MIT Laboratory for Computer Science;MIT Laboratory for Computer Science;University of California, Berkeley

  • Venue:
  • SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
  • Year:
  • 2001

Quantified Score

Hi-index 0.06

Visualization

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.