Assuring demanded read performance of data deduplication storage with backup datasets

Proceedings of the 2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, MASCOTS 2012

Volumn , Issue , 2012, Pages 201-208

  Nam, Young Jin ^a,b   Park, Dongchul ^b   Du, David H C ^b  

^a Daegu University   (South Korea)

^b UNIVERSITY OF MINNESOTA   (United States)

Author keywords

data deduplication; read performance; storage

Indexed keywords

DATA BACKUPS; DATA SETS; DATA STREAM; DEDUPLICATION; FAST RECOVERY; ON THE FLIES; READ PERFORMANCE; SPATIAL LOCALITY; STORAGE SPACES; STORAGE SYSTEMS; STRONG CORRELATION; TARGET SYSTEMS;

COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; ENERGY STORAGE;

DIGITAL STORAGE;

EID: 84868221471     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MASCOTS.2012.32     Document Type: Conference Paper

References (16)

1. P. Efstathopoulos and F. Guo, "Rethinking deduplication scalability," in Proceedings of USENIX HotStorage, 2010.
2. B. Zhu, K. Li, and H. Patterson, "Avoiding the disk bottlenext in the data domain deduplication file system," in Proceedings of the 6th USENIX File and Storage Technologies, 2008.
3. G. Lu, Y. Nam, and D. Du, "BloomStore: Bloom-filter based memory-efficient key-value store for indexing of data deduplication on flash," in Proceedings of the 28th IEEE Symposium on Massive Data Storage (MSST/SNAPI), 2012.
4. N. Park and D. Lilja, "Characterizing datasets for data deduplication in backup applications," in Proceedings of 2010 IEEE International Symposium on Workload Characterization, 2010.
5. G. Lu, Y. Jin, and D. Du, "Frequency based chunking for data de-duplication," in Proceedings of International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems (MASCOTS), 2010.
6. H. Lim, B. Fan, D. Andersen, and M. Kaminsky, "SILT: A memory-efficient, high-performance key-value store," in Proceedings of the 23rd ACM Symposium on Operating Systems Principles (SOSP2011), 2011.
7. Y. Tsuchiya and T. Watanabe, "DBLK: Deduplication for primary block storage," in Proceedings of the 27th IEEE Symposium on Massive Storage Systems and Technologies, 2011.
8. W. Dong, F. Douglis, K. Li, H. Patterson, S. Reddy, and P. Shilane, "Tradeoffs in scalable data routing for deduplication clusters," in Proceedings of the 9th USENIX File and Storate Technologies, 2011.
9. Y. Nam, G. Lu, N. Park, W. Xiao, and D. Du, "Chunk Fragmentation Level: An effective indicator for read performance degradation in deduplication storage," in Proceedings of IEEE International Symposium of Advances on High Performance Computing and Networking (AHPCN2011), 2011.
10. "LTDP Reference Model," http://www.ltdprm.org.
11. D. Kay and M. Maybee, "Aspects of deduplication," SNIA Spring 2010 Tutorials, 2010.
12. M. Rabin, "Figerprinting by random ploynomials," Harvard University Technical Report TR-15-81, 1981.
13. "Sparsehash," http://code.google.com/p/sparsehash/.
14. H. Lee, Y. Nam, and C. Park, "Regulating I/O performance of shared storage with a control theoretical approach," in Proceedings of the 21st IEEE Mass Storage Systems Symposium/ 12th NASA Goddard Conference on Mass Storage Systems and Technologies (MSST2004), 2004.
15. R. Koller and R. Raju, "I/O Deduplication: Utilizing content similarity to improve I/O performance," in Proceedings of the 8th USENIX File and Storage Technologies, 2010.
16. K. Srinivasan, T. Bisson, G. Goodson, and K. Voruganti, "iDedup: Latency-aware, inline data deduplicationfor primary storage," in Proceedings of the 10th USENIX File and Storate Technologies, 2012.