A Cooperative Internet Backup Scheme

We present a novel peer-to-peer backup technique that allows computers connected to the Internet to back up their data cooperatively: Each computer has a set of partner computers, which collectively hold its backup data. In return, it holds a part of each partner's backup data. By adding redundancy and distributing the backup data across many partners, a highly-reliable backup can be obtained in spite of the low reliability of the average Internet machine. Because our scheme requires cooperation, it is potentially vulnerable to several novel attacks involving free riding (e.g., holding a partner's data is costly, which tempts cheating) or disruption. We defend against these attacks using a number of new methods, including the use of periodic random challenges to ensure partners continue to hold data and the use of disk-space wasting to make cheating unprofitable. Results from an initial prototype show that our technique is feasible and very inexpensive: it appears to be one to two orders of magnitude cheaper than existing Internet backup services.

[1]  Moni Naor,et al.  Nonmalleable Cryptography , 2000, SIAM Rev..

[2]  DruschelPeter,et al.  Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility , 2001 .

[3]  Brian D. Noble,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Pastiche: Making Backup Cheap and Easy , 2022 .

[4]  Alexander L. Semenov Solving Optimization Problems with Help of the UniCalc Solver , 1996 .

[5]  Marvin Theimer,et al.  Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs , 2000, SIGMETRICS '00.

[6]  James S. Plank A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems , 1997 .

[7]  Nick Mathewson,et al.  Reputation in privacy enhancing technologies , 2002, CFP '02.

[8]  Manuel Blum,et al.  Coin flipping by telephone a protocol for solving impossible problems , 1983, SIGA.

[9]  Eldon Hansen,et al.  Global optimization using interval analysis , 1992, Pure and applied mathematics.

[10]  Andrew V. Goldberg,et al.  A prototype implementation of archival Intermemory , 1999, DL '99.

[11]  R. Anderson The Eternity Service , 1996 .

[12]  ChrisWells ComputerScienceDivision Universityof The OceanStore Archive : Goals , Structures , and Self-Repair , 2001 .

[13]  Roger Dingledine,et al.  The Free Haven Project : design and deployment of an anonymous secure data haven , 2000 .

[14]  Jon G. Rokne,et al.  New computer methods for global optimization , 1988 .

[15]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[16]  Antony I. T. Rowstron,et al.  Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility , 2001, SOSP.

[17]  A. Neumaier Interval methods for systems of equations , 1990 .

[18]  Sergey P. Shary,et al.  On optimal solution of interval linear equations , 1995 .

[19]  Antony I. T. Rowstron,et al.  PAST: a large-scale, persistent peer-to-peer storage utility , 2001, Proceedings Eighth Workshop on Hot Topics in Operating Systems.