Pond: The OceanStore Prototype
By Sean C. Rhea, Patrick R. Eaton, Dennis Geels, Hakim Weatherspoon, Ben Y. Zhao, John D. Kubiatowicz. USENIX Conference on File and Storage Technologies, 2003
547 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/1827878c0bc4da9c99354c7334cc31cfd23f9989
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- A. Dimakis
- N. Feamster
- Frank Dabek
- Byung-Gon Chun
- Emil Sit
- Jennifer Rexford
- Hussam Abu-Libdeh
- Robert Morris
Citations in the corpus
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction (2010, methodology): “Several distributed storage systems such as RAID-6 [1], OceanStore [2] and Total Recall [3] employ such an erasure-coding option.”
- 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].”
- OpenDHT: a public DHT service and its uses (2005, unknown): “Authenticated puts in OpenDHT are similar to those used for public-key blocks in CFS [9], for sfrtagsin SFR [33], forfileIds in PAST [14], and for AGUIDs in Pond [28].”
- Sinfonia: a new paradigm for building scalable distributed systems (2007, background): “Pond [Rhea et al. 2003] is a prototype of OceanStore, a distributed system for storing data objects in a wide-area network.”
- Fault-scalable Byzantine fault-tolerant services (2005, background): “, both Farsite [3] and Pond/OceanStore [34] use this approach).”
- Efficient Replica Maintenance for Distributed Storage Systems (2006, methodology): “We used Oceanstore [20, 30 ] and the BambooDHT [31] to developa distributeddirectory system usinglargescope and random placement.”
- In VINI veritas: realistic and controlled network experimentation (2006, methodology): “CO is applied in today’s core networks and it is currently favored by many Internet service providers (ISPs) and researchers as the preferred mechanism for QoS [28].”
- Tapestry: a resilient global-scale overlay for service deployment (2004, unknown): “In addition, several decentralized file systems have been proposed: CFS [23] (Chord), Mnemosyne [24] (Chord, Tapestry), OceanStore [4] (Tapestry), and PAST [25] (Pastry).”
- A Secure Erasure Code-Based Cloud Storage System with Secure Data Forwarding (2012, methodology): “One way to reduce the expansion rate is to use erasure codes to encode messages [10], [11], [12], [13], [5].”
- Blockstack: A Global Naming and Storage System Secured by Blockchains (2016, background): “Blockstack differs from decentralized storage systems which allow open membership but offer stronger-than-eventual data consistency (like Shark [9], Pond [48], and Scatter [25]) by focusing on decentralization while supporting a wide variety of external datastores that give strong consistency.”
- Designing a DHT for Low Latency and High Throughput (2004, methodology): “This exploration of design decisions emerged from an effort to understand a number of recent DHT-like systems with different designs, including OceanStore/Pond [22, 34 , 43], CFS [13], Overnet [28, 32], PAST [6, 37, 38] FarSite [1], and Pastiche [11].”
- Secure data deduplication (2008, methodology): “Pond: the OceanStore prototype.”
- RACS: a case for cloud storage diversity (2010, methodology): “Peer-to-peer storage [19–21, 32] have employed RAID-like techniques to ensure the availability and durability of data.”
- Network Coding for Distributed Storage Systems (2007, methodology): “To obtain bounds on the how much each storage node has to download, we start with the following simple lemma.”