Wide-area cooperative storage with CFS

By Frank Dabek, M. Frans Kaashoek, David R Karger, Robert Morris, Ion Stoica. Symposium on Operating Systems Principles, 2001

1,906 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/9444fdfd7bee92fdf71da6b82d6b66afe423898b

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

1. Ion Stoica
2. John Risson
3. Tim Moors
4. Peter Druschel
5. Scott Shenker
6. Hector Garcia-Molina
7. John D. Kubiatowicz
8. Antony Ian Taylor Rowstron

Citations in the corpus

• Democratizing Content Publication with Coral (2004, background): “SkipNet [10] similarly builds a hierarchy of lookup groups, although they explicitly divide the key-space by DNS name to support organizational disconnect.”
• OpenDHT: a public DHT service and its uses (2005, positive): “3.1 The put/get API The OpenDHT put/get interface supports a range of application needs, from storage in the style of the Cooperative File System (CFS) [9] to naming and rendezvous in the style of the Host Identity Protocol (HIP) [21] and instant messaging.”
• NetCache: Balancing Key-Value Stores with Fast In-Network Caching (2017, methodology): “Traditional methods use consistent hashing [24] and virtual nodes [13] to mitigate load imbalance, but these solutions fall short when dealing with workload changes.”
• Informed content delivery across adaptive overlay networks (2002, background): “This lack of deployment has led to the development of end-system approaches [9, 13, 8], along with a wide variety of related schemes relevant to peer-to-peer content delivery architectures [23, 10, 26, 29, 12, 20, 28].”
• A Self-Organizing Flock of Condors (2003, neutral): “Examples of p2p applications include distributed storage facilities [27, 6 ], application-level multicast [4, 33, 31], and routing in mobile ad-hoc networks [16].”
• 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.”
• Peer-to-peer support for massively multiplayer games (2004, background): “width, including storage systems [12], [33], [11], content distribution [9], [20] and instant messaging [26].”
• PocketLens: Toward a personal recommender system (2004, background): “4.4 Content Addressable Our next architecture is based on recent advances in architectures for peer-to­peer .le sharing networks such as Chord, CAN, and Pastry [Stoica et al. 2001; Ratnasamy et al.”
• Tarzan: a peer-to-peer anonymizing network layer (2002, background): “For instance, CFS [6] separates its file-system block store from its Chord lookup mechanism.”
• Efficient Replica Maintenance for Distributed Storage Systems (2006, methodology): “The Chord/DHash system [8, 9] served as the basis for our consistent hashing implementation.”
• Symphony: Distributed Hashing in a Small World (2003, methodology): “The research community is working on a wide variety of peer to peer applications like persistent data storage (CFS 6], Farsite 3], Oceanstore 11], PAST 19]), event notiication and application level multicast (Bayeux 23], Scribe 20] and CAN-based Multicast 17]), DNS 5], resource discovery 2] and coop”
• Efficient search in peer to peer networks (2004, methodology): “Keywords: Peer-to-peer, distributed data, search, performance modeling, evaluation Technical Area(s): Databases, performance modeling and evaluation”
• Total Recall: System Support for Automated Availability Management (2004, methodology): “Files stored using eager repair use a modified version of the DHash block store [8].”
• Survey of research towards robust peer-to-peer networks: Search methods (2006, background): “Applications [1, 198-200] Memory [32, 90, 142, 201-222] File Systems Web Content Delivery Networks Directories Service Discovery Publish / Subscribe .”
• A scalable distributed information management system (2004, background): “While search application is a predominant target application for DHTs, several other applications like multicast [4, 5, 29, 32], file storage [8, 15, 28], and DNS [7] are also being built using DHTs.”
• Designing a DHT for Low Latency and High Throughput (2004, background): “The throughput optimizations result in a sustainable bulk read throughput related to the number of DHT hosts times the capacity of the slowest access link; with 150 selected PlanetLab hosts, the peak aggregate throughput over multiple clients is 12.8 megabytes per second.”