A cooperative internet backup scheme. Lillibridge, M., Elnikety, S., Birrell, A. D., Burrows, M., & Isard, M. 2003. ![A cooperative internet backup scheme [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper abstract bibtex 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\textquoterights 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\textquoterights 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.
@conference {1247343,
title = {A cooperative internet backup scheme},
booktitle = {ATEC {\textquoteright}03: Proceedings of the annual conference on USENIX Annual Technical Conference},
year = {2003},
pages = {3{\textendash}3},
publisher = {USENIX Association},
organization = {USENIX Association},
address = {Berkeley, CA, USA},
abstract = {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{\textquoteright}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{\textquoteright}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.},
keywords = {backup, P2P, redundancy},
url = {http://portal.acm.org/citation.cfm?id=1247343$\#$},
author = {Mark Lillibridge and Sameh Elnikety and Andrew D. Birrell and Mike Burrows and Isard, Michael}
}
Downloads: 0
{"_id":"LF8pp5t6kiPmSACgT","bibbaseid":"lillibridge-elnikety-birrell-burrows-isard-acooperativeinternetbackupscheme-2003","downloads":0,"creationDate":"2018-07-03T04:50:27.358Z","title":"A cooperative internet backup scheme","author_short":["Lillibridge, M.","Elnikety, S.","Birrell, A. D.","Burrows, M.","Isard, M."],"year":2003,"bibtype":"conference","biburl":"https://gnunet.org/bibliography/export/bibtex","bibdata":{"bibtype":"conference","type":"conference","title":"A cooperative internet backup scheme","booktitle":"ATEC \\textquoteright03: Proceedings of the annual conference on USENIX Annual Technical Conference","year":"2003","pages":"3\\textendash3","publisher":"USENIX Association","organization":"USENIX Association","address":"Berkeley, CA, USA","abstract":"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\\textquoterights 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\\textquoterights 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.","keywords":"backup, P2P, redundancy","url":"http://portal.acm.org/citation.cfm?id=1247343$#$","author":[{"firstnames":["Mark"],"propositions":[],"lastnames":["Lillibridge"],"suffixes":[]},{"firstnames":["Sameh"],"propositions":[],"lastnames":["Elnikety"],"suffixes":[]},{"firstnames":["Andrew","D."],"propositions":[],"lastnames":["Birrell"],"suffixes":[]},{"firstnames":["Mike"],"propositions":[],"lastnames":["Burrows"],"suffixes":[]},{"propositions":[],"lastnames":["Isard"],"firstnames":["Michael"],"suffixes":[]}],"bibtex":"@conference {1247343,\n\ttitle = {A cooperative internet backup scheme},\n\tbooktitle = {ATEC {\\textquoteright}03: Proceedings of the annual conference on USENIX Annual Technical Conference},\n\tyear = {2003},\n\tpages = {3{\\textendash}3},\n\tpublisher = {USENIX Association},\n\torganization = {USENIX Association},\n\taddress = {Berkeley, CA, USA},\n\tabstract = {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{\\textquoteright}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.\r\n\r\nBecause our scheme requires cooperation, it is potentially vulnerable to several novel attacks involving free riding (e.g., holding a partner{\\textquoteright}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.},\n\tkeywords = {backup, P2P, redundancy},\n\turl = {http://portal.acm.org/citation.cfm?id=1247343$\\#$},\n\tauthor = {Mark Lillibridge and Sameh Elnikety and Andrew D. Birrell and Mike Burrows and Isard, Michael}\n}\n","author_short":["Lillibridge, M.","Elnikety, S.","Birrell, A. D.","Burrows, M.","Isard, M."],"key":"1247343","id":"1247343","bibbaseid":"lillibridge-elnikety-birrell-burrows-isard-acooperativeinternetbackupscheme-2003","role":"author","urls":{"Paper":"http://portal.acm.org/citation.cfm?id=1247343$#$"},"keyword":["backup","P2P","redundancy"],"downloads":0},"search_terms":["cooperative","internet","backup","scheme","lillibridge","elnikety","birrell","burrows","isard"],"keywords":["backup","p2p","redundancy"],"authorIDs":[],"dataSources":["FWsPTwsmjtrBtRS3B"]}