The Community for Technology Leaders
14th IEEE International Symposium on Modeling, Analysis, and Simulation (2006)
Monterey, CA
Sept. 11, 2006 to Sept. 14, 2006
ISSN: 1526-7539
ISBN: 0-7695-2573-3
pp: 413-421
Deepavali Bhagwat , University of California, Santa Cruz, USA
Kristal Pollack , University of California, Santa Cruz, USA
Darrell D. E. Long , University of California, Santa Cruz, USA
Thomas Schwarz , University of California, Santa Cruz, USA
Ethan L. Miller , University of California, Santa Cruz, USA
Jehan-Francois Paris , University of Houston, USA
ABSTRACT
Inter-file compression techniques store files as sets of references to data objects or chunks that can be shared among many files. While these techniques can achieve much better compression ratios than conventional intra-file compression methods such as Lempel-Ziv compression, they also reduce the reliability of the storage system because the loss of a few critical chunks can lead to the loss of many files. We show how to eliminate this problem by choosing for each chunk a replication level that is a function of the amount of data that would be lost if that chunk were lost. Experiments using actual archival data show that our technique can achieve significantly higher robustness than a conventional approach combining data mirroring and intra-file compression while requiring about half the storage space.
INDEX TERMS
null
CITATION

D. D. Long, T. Schwarz, D. Bhagwat, E. L. Miller, J. Paris and K. Pollack, "Providing High Reliability in a Minimum Redundancy Archival Storage System," 14th IEEE International Symposium on Modeling, Analysis, and Simulation(MASCOTS), Monterey, CA, 2006, pp. 413-421.
doi:10.1109/MASCOTS.2006.42
91 ms
(Ver 3.3 (11022016))