A low-bandwidth network file system

By Athicha Muthitacharoen, Benjie Chen, David Mazières. Symposium on Operating Systems Principles, 2001

1,068 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Hardware and Architecture

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

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

In Hardware and Architecture

Citations in the corpus

Extreme Binning: Scalable, parallel deduplication for chunk-based file backup (2009, methodology): “Variable-length chunking has been used to conserve bandwidth [6], to weed out near duplicates in large repositories [5], for wide-area distributed file systems [12], and, to store and transfer large directory trees efficiently and with high reliability [13] Figure 1 depicts the sliding window…”
ChunkStash: Speeding Up Inline Storage Deduplication Using Flash Memory (2010, methodology): “EMC’s Centera [18] uses file level duplication, LBFS [31] uses variablesized data chunks obtained using Rabin fingerprinting, and Venti [36] uses individual fixed size disk blocks.”
Energy-aware lossless data compression (2006, methodology): “The Low-Bandwidth File System (LBFS) exploits similarities between the data stored on a client and server, to exchange only data blocks which differ [Muthitacharoen et al. 2001].”
Secure data deduplication (2008, methodology): “Variable-length chun ks are used in LBFS [25], Shark [4], and Deep Store [38].”
Automated Worm Fingerprinting (2004, methodology): “use Rabin fingerprints for compressing content sent over a network [40, 27].”
Secure Untrusted Data Repository (SUNDR) (2004, background): “Moreover, recent work [17] suggests that by breaking files into carefully-constructed variable-sized blocks, one can increase the number of blocks common across files.”
Reclaiming space from duplicate files in a serverless distributed file system (2002, background): “LBFS [ 28 ] identifies identical portions of different files to reduce network bandwidth rather than storage usage.”
Message-Locked Encryption for Lock-Dependent Messages (2013, neutral): “example, [28,35,26]).”
The Case for VM-Based Cloudlets in Mobile Computing (2009, methodology): “Variants of the alternative approach have been used in systems such as LBFS [12], Casper [19], Shark [3], the Internet Suspend/Resume system [9], the Collective [14], and KeyChain [2].”
Sparse Indexing: Large Scale, Inline Deduplication Using Sampling and Locality (2009, methodology): “With this method, data to be deduplicated is broken into variable-length chunks using content-based chunk boundaries [20], and incoming chunks are compared with the chunks in the store by hash comparison; only chunks that are not already there are stored.”
Internet suspend/resume (2002, methodology): “One way to achieve this is to use differential file transmission techniques such as those described by Tridgell [19] for rsync, or by Muthitacharoen et al [11] for their lowbandwidth file system.”
A Comprehensive Study of the Past, Present, and Future of Data Deduplication (2016, methodology): “These chunks can be fixed in size [11], like file blocks, or variable-sized units determined by the content itself [14].”