Farsite

By Atul Adya, William J. Bolosky, Miguel Oom Temudo de Castro, G. Cermak, Ronnie Chaiken, John R. Douceur, Jon Howell, Jacob R. Lorch, Marvin Theimer, Roger Wattenhofer. USENIX Symposium on Operating Systems Design and Implementation, 2002

1,060 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/eb4a78f42343c6e6de9032600bcf1936de841fd3

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

Deterministic and Efficiently Searchable Encryption (2007, methodology): “Thanks also to Diana Smetters and Dan Wallach for pointing us to the work of [2, 29], and to Nisheeth Vishnoi for help in formulating and proving Theorem 4.”
Chain Replication for Supporting High Throughput and Availability (2004, background): “Douceur and Wattenhofer investigate how to maximize the worst-case availability of files in FARSITE [2], while spreading the storage load evenly across all servers [8, 9].”
Live wide-area migration of virtual machines including local persistent state (2007, background): “Peer to peer file systems [1, 4] allow VMs to use a set of unknown remote peers for storing their persistent state.”
Depot: Cloud Storage with Minimal Trust (2010, methodology): “FARSITE [10] targets decentralized environments and seeks to minimize trust; nevertheless, it uses BFT RSM techniques so, unlike Depot, does not minimize trust for correctness or availability.”
A Secure Erasure Code-Based Cloud Storage System with Secure Data Forwarding (2012, background): “There have been many proposals of storing data over storage servers [1], [2], [3], [4], [5].”
Plutus: Scalable Secure File Sharing on Untrusted Storage (2003, methodology): “There are several file systems such as Cedar [18], Elephant [41], Farsite [1], Venti [38], and Ivy [36], which treat file data as immutable objects.”
Secure data deduplication (2008, methodology): “This technique, first introduced in the context of the F arsite system [1, 10], provides a deterministic way of generating a encryption key, such that two different users can encrypt data to the same ciphertext.”
Dynamo: amazon's highly available key-value store (2007, methodology): “The Farsite system [1] is a distributed file system that does not use any centralized server like NFS.”
BAR fault tolerance for cooperative services (2005, background): “For applications in which nodes must all be able to work together, these state machines should be able to communicate with each other [2, 50].”
Total Recall: System Support for Automated Availability Management (2004, methodology): “For example, the CFS system relies on a static replication factor coupled with an active repair policy, as does Microsoft’s FARSITE system (although FARSITE calculates the replication factor as a function of total storage and and is more careful about replica placement) [1,8,9].”
Reliable Client Accounting for Hybrid Content-Distribution Networks (2012, background): “Another approach relies on certification authorities, as in [6].”
MR-PDP: Multiple-Replica Provable Data Possession (2008, background): “Systems re-replicate data when replicas fail [10, 12], evaluate the correctness of replicas in the system [20], and move replicas among sites to meet availability goals [2,9].”