TAPER: Tiered approach for eliminating redundancy in replica synchronization

FAST 2005 - 4th USENIX Conference on File and Storage Technologies

Volumn , Issue , 2005, Pages 281-294

  Jain, Navendu ^a   Dahlin, Mike ^a   Tewari, Renu ^b  

^a University of Texas at Austin   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; DATA STRUCTURES; DIGITAL STORAGE; ECONOMIC AND SOCIAL EFFECTS; REDUNDANCY;

BANDWIDTH EFFICIENCY; BANDWIDTH EFFICIENT; BANDWIDTH SAVINGS; COMPUTATION OVERHEADS; CONTENT DISTRIBUTION NETWORKS; REDUNDANCY ELIMINATION; SIMILARITY DETECTION; SOFTWARE DISTRIBUTIONS;

TREES (MATHEMATICS);

EID: 85059490022     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. http://th.informatik.uni-mannheim.de/people/lucks/hashcollisions/.
2. Rsync http://rsync.samba.org.
3. A. Adya, W. J. Bolosky, M. Castro, G. Cermak, R. Chaiken, J. R. Douceur, J. Howell, J. R. Lorch, M. Theimer, and R. P. Wattenhofer. FARSITE: Federated, available, and reliable storage for an incompletely trusted environment. In OSDI, Dec. 2002.
4. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13(7):422–426, 1970.
5. A. Z. Broder. On the resemblance and containment of documents. In SEQUENCES, 1997.
6. A. Z. Broder. Identifying and filtering near-duplicate documents. In COM, pages 1–10, 2000.
7. A. Z. Broder, S. C. Glassman, M. S. Manasse, and G. Zweig. Syntactic clustering of the web. In WWW, 1997.
8. A. Z. Broder and M. Mitzenmacher. Network applications of Bloom filters: A survey. In Allerton, 2002.
9. D. Fetterly, M. Manasse, and M. Najork. On the evolution of clusters of near-duplicate web pages. In LA-WEB, 2003.
10. V. Henson. An analysis of compare-by-hash. In HotOS IX, 2003.
11. D. Hitz, J. Lau, and M. Malcolm. File system design for an NFS file server appliance. Technical Report TR-3002, Network Appliance Inc.
12. U. Irmak and T. Suel. Hierarchical substring caching for efficient content distribution to low-bandwidth clients. In WWW, 2005.
13. N. Jain, M. Dahlin, and R. Tewari. TAPER: Tiered approach for eliminating redundancy in replica synchronization. Technical Report TR-05-42, Dept. of Comp. Sc., Univ. of Texas at Austin.
14. D. G. Korn and K.-P. Vo. Engineering a differencing and compression data format. In USENIX Annual Technical Conference, General Track, pages 219–228, 2002.
15. P. Kulkarni, F. Douglis, J. D. LaVoie, and J. M. Tracey. Redundancy elimination within large collections of files. In USENIX Annual Technical Conference, General Track, pages 59–72, 2004.
16. J. Langford. Multiround rsync. Unpublished manuscript. http://www-2.cs.cmu.edu/~jcl/research/mrsync/mrsync.ps.
17. U. Manber. Finding similar files in a large file system. In USENIX Winter Technical Conference, 1994.
18. M. Mitzenmacher. Compressed Bloom filters. IEEE/ACM Trans. Netw., 10(5):604–612, 2002.
19. J. C. Mogul, Y.-M. Chan, and T. Kelly. Design, implementation, and evaluation of duplicate transfer detection in HTTP. In NSDI, 2004.
20. A. Muthitacharoen, B. Chen, and D. Mazieres. A low-bandwidth network file system. In SOSP, 2001.
21. S. Quinlan and S. Dorward. Venti: a new approach to archival storage. In FAST, 2002.
22. M. O. Rabin. Fingerprinting by random polynomials. Technical Report TR-15-81, Harvard University, 1981.
23. S. C. Rhea, K. Liang, and E. Brewer. Value-based web caching. In WWW, pages 619–628, 2003.
24. C. P. Sapuntzakis, R. Chandra, B. Pfaff, J. Chow, M. S. Lam, and M. Rosenblum. Optimizing the migration of virtual computers. In OSDI, Dec. 2002.
25. R. Thurlow. A server-to-server replication/migration protocol. IETF Draft May 2003.
26. X. Wang, Y. Yin, and H. Yu. Finding collisions in the full SHA1. In Crypto, 2005.
27. L. You, K. Pollack, and D. D. E. Long. Deep store: an archival storage system architecture. In ICDE, pages 804–815, 2005.