ACM Home Page
Please provide us with feedback. Feedback
Pastiche: making backup cheap and easy
Full text PdfPdf (1.65 MB)
Source ACM SIGOPS Operating Systems Review archive
Volume 36 ,  Issue SI  (Winter 2002) table of contents
OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
SPECIAL ISSUE: Peer-to-peer infrastructure table of contents
Pages: 285 - 298  
Year of Publication: 2002
ISSN:0163-5980
Authors
Landon P. Cox  University of Michigan, Ann Arbor, MI
Christopher D. Murray  University of Michigan, Ann Arbor, MI
Brian D. Noble  University of Michigan, Ann Arbor, MI
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 93,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/844128.844155
What is a DOI?

ABSTRACT

Backup is cumbersome and expensive. Individual users almost never back up their data, and backup is a significant cost in large organizations. This paper presents Pastiche, a simple and inexpensive backup system. Pastiche exploits excess disk capacity to perform peer-to-peer backup with no administrative costs. Each node minimizes storage overhead by selecting peers that share a significant amount of data. It is easy for common installations to find suitable peers, and peers with high overlap can be identified with only hundreds of bytes. Pastiche provides mechanisms for confidentiality, integrity, and detection of failed or malicious peers. A Pastiche prototype suffers only 7.4% overhead for a modified Andrew Benchmark, and restore performance is comparable to cross-machine copy.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
C. Batten, K. Barr, A. Saraf, and S. Trepetin. pStore: A secure peer-to-peer backup system. Unpublished report, MIT Laboratory for Computer Science, December 2001.
 
4
 
5
W. J. Bolosky, S. Corbin, D. Goebel, and J. R. Douceur. Single instance storage in Windows 2000. In Proceedings of the 4th USENIX Windows Systems Symposium, pages 13--24, Seattle, WA, August 2000.
6
 
7
 
8
9
 
10
M. Castro, P. Druschel, Y. C. Hu, and A. Rowstron. Exploiting network proximity in peer-to-peer overlay networks. Submitted for publication.
 
11
 
12
D. Chaum. Blind signatures for untraceable payments. In Advances in Cryptology: Proceedings of Crypto '82, pages 199--203, August 1982.
 
13
A. L. Chervenak, V. Vellanki, and Z. Kurmas. Protecting file systems: A survey of backup techniques. In Proceedings of the Joint NASA and IEEE Mass Storage Conference, March 1998.
 
14
 
15
Connected Corporation. The 60% you're missing: Preventing data loss through PC management. White paper, Farmingham, MA, 2002.
16
 
17
J. Daemen and V. Rijmen. AES proposal: Rijndael. Advanced Encryption Standard Submission, 2nd version, March 1999.
 
18
19
20
 
21
S. Elnikety, M. Lillibridge, M. Burrows, and W. Zwaenepoel. Cooperative backup system. In The USENIX Conference on File and Storage Technologies, Monterey, CA, January 2002. Work-in-progress report.
 
22
D. Hitz, J. Lau, and M. A. Malcom. File system design for an NFS file server appliance. In Proceedings USENIX Winter Technical Conference, pages 235--246, San Francisco, CA, January 1994.
23
 
24
A. Juels and J. Brainard. Client puzzles: A cryptographic countermeasure against connection depletion attacks. In Proceedings of the Network and Distributed System Security Symposium, pages 151--165, San Diego, CA, February 1999.
25
 
26
S. R. Kleiman. Vnodes: An architecture for multiple file system types in Sun UNIX. In USENIX Association Summer Conference Proceedings, pages 238--247, Atlanta, GA, June 1986.
 
27
U. Manber. Finding similar files in a large file system. In Proceedings of the USENIX Winter 1994 Conference, pages 1--10, San Francisco, CA, January 1994.
 
28
 
29
Microsoft Corporation. SimPastry. http://www.research.microsoft.com/~ antr/Pastry/ download.htm.
30
 
31
National Institute of Standards and Technology. Computer data authentication. FIPS Publication #113, May 1985.
 
32
National Institute of Standards and Technology. Secure hash standard. FIPS Publication #180-1, April 1997.
 
33
Network Appliance. NetApp unveils first nearstore release. Computer Reseller News, page 33, March 25, 2002.
 
34
 
35
W. W. Peterson and E. J. Weldon. Error-correcting Codes. The MIT Press, 1972.
 
36
 
37
 
38
 
39
M. O. Rabin. Fingerprinting by random polynomials. Technical Report TR-15-81, Center for Research in Computing Technology, Harvard University, 1981.
 
40
 
41
42
43
 
44
M. Satyanarayanan. RPC2 User Guide and Reference Manual. School of Computer Science, Carnegie Mellon University, October 1991.
45
46
 
47
J. D. Strunk, G. R. Goodson, M. L. Scheinholtz, C. A. N. Soules, and G. R. Ganger. Self-securing storage: Protecting data in compromised systems. In Proceedings of the 4th Symposium on Operating Systems Design and Implementation, pages 165--179, San Diego, CA, October 2000.
 
48
A. Tridgell. Efficient algorithms for sorting and synchronization. PhD thesis, The Austrailian National University, 1999.
 
49
50
 
51
A. Westerlund and J. Danielsson. Arla--afree afs client. In Proceedings of 1998 USENIX, Freenix track, New Orleans, LA, June 1998.

CITED BY  7

Collaborative Colleagues:
Landon P. Cox: colleagues
Christopher D. Murray: colleagues
Brian D. Noble: colleagues