2Tolia N, Kozuch M, Satyanarayanan M, et al. Opportunistic use of content addressable storage for distributed file systems[C]//Proc Usenix Annual Technical Conference. USENIX Assoc, 2003: 127-140.
3Quinlan S, Dorward S. Venti: A new approach to archival storage[C]// Proc Conf File and Storage Technologies. USENIX Assoc, 2002:89 - 102.
4Muthitacharoen A, CHEN Benjie, Mazieres D, et al. A low bandwidth network file system[C]// Proc 18th ACM Syrup Operat Syst Principles. New York:ACM Press, 2001: 174 - 187.
5Rabin M O. Fingerprinting by random polynomials, TR -15- 81[R]. Boston: Center for Research in Computing Technology, Harvard University, 1981.
6LIU Chuanyi, LU Yingping, DU David, et al. ADMAD: Application-driven metadata aware de duplication archival storage system [C]// Proc 25th IEEG Conf Mass Storage Syst and Technol. Piseataway, NJ: IEEE Press, 2008:29 - 35.
7Wylie J J, Swaminathan R. Determining fault tolerance of XOR-based erasure codes efficiently [C]// Proc 37th Annual IEEE/IFIP Int Conf Dependable Syst Networks. Piscataway, NJ: IEEE Press, 2007: 206-215.
8Peterson W W, Weldon E J. Error Correcting Codes, 2nd Edition[M]. Cambridge: MIT Press, 1972.
9MacWilliams F J, Sloane N J A. The Theory of Error-Correcting Codes, Part I[M]. Amsterdam: North-Holland, 1977.
10Luby M G, Mitzenmacher M, Shokrollahi M A, et al. Efficient erasure correcting codes [J]. IEEE Trans Info Theo, 2001, 47(2): 569-584.
