2003 · 643 citations · 33 references
ComputingComputer ScienceComputer SystemsDistributed SystemsFault ToleranceFault-tolerant SystemsData RedundancyData ReplicationDistributed StorageDistributed Storage SystemsFile SystemsStorage ManagementEncryptionFile System PerformanceFile System ReplicationReplica PlacementScalable File System DesignSpace-saving StorageStorage Space AllocationStorage Space Planning
Farsite replicates each file across multiple desktop computers, consuming significant storage space that must be reclaimed where possible. The authors aim to reclaim space from incidental duplication so that it can be used for controlled file replication. Their approach uses convergent encryption to coalesce duplicate files into a single encrypted copy and a Self‑Arranging Lossy Associative Database (SALAD) to aggregate file content and location information in a decentralized, scalable, fault‑tolerant manner. Measurements of over 500 desktop file systems show that nearly half of the storage is occupied by duplicate files, and large‑scale simulations demonstrate that the proposed system is scalable, highly effective, and fault‑tolerant.
The Farsite distributed file system provides availability by replicating each file onto multiple desktop computers. Since this replication consumes significant storage space, it is important to reclaim used space where possible. Measurement of over 500 desktop file systems shows that nearly half of all consumed space is occupied by duplicate files. We present a mechanism to reclaim space from this incidental duplication to make it available for controlled file replication. Our mechanism includes: (1) convergent encryption, which enables duplicate files to be coalesced into the space of a single file, even if the files are encrypted with different users' keys; and (2) SALAD, a Self-Arranging Lossy Associative Database for aggregating file content and location information in a decentralized, scalable, fault-tolerant manner. Large-scale simulation experiments show that the duplicate-file coalescing system is scalable, highly effective, and fault-tolerant.
33
Handbook of applied cryptography
Choice Reviews Online · 1997 · 10.5K citations · Full text
Ion Stoica, Robert Morris, David R. Karger et al. · 2001 · 9.7K citations
Space/time trade-offs in hash coding with allowable errors
Burton H. Bloom · Communications of the ACM · 1970 · 7.5K citations · Full text
A scalable content-addressable network
Sylvia Ratnasamy, Paul Francis, Mark Handley et al. · 2001 · 6.4K citations · Full text
Mihir Bellare, Phillip Rogaway · 1993 · 4.7K citations · Full text