The LOCKSS project has developed and deployed in a world-wide test a peer-to-peer system for preserving access to journals and other archival information published on the Web. It consists of a large number of independent, low-cost, persistent Web caches that cooperate to detect and repair damage to their content by voting in “opinion polls.” Based on this experience, we present a design for and simulations of a novel protocol for voting in systems of this kind. It incorporates rate limitation and intrusion detection to ensure that even some very powerful adversaries attacking over many years have only a small probability of causing irrecoverable damage before being detected.
Description
The LOCKSS peer-to-peer digital preservation system
%0 Journal Article
%1 1047917
%A Maniatis, Petros
%A Roussopoulos, Mema
%A Giuli, T. J.
%A Rosenthal, David S. H.
%A Baker, Mary
%C New York, NY, USA
%D 2005
%I ACM Press
%J ACM Trans. Comput. Syst.
%K drm langzeitarchivierung openaccess p2p
%N 1
%P 2--50
%R http://doi.acm.org/10.1145/1047915.1047917
%T The LOCKSS peer-to-peer digital preservation system
%U http://portal.acm.org/citation.cfm?id=1047917&coll=Portal&dl=ACM&CFID=27628983&CFTOKEN=96340807#
%V 23
%X The LOCKSS project has developed and deployed in a world-wide test a peer-to-peer system for preserving access to journals and other archival information published on the Web. It consists of a large number of independent, low-cost, persistent Web caches that cooperate to detect and repair damage to their content by voting in “opinion polls.” Based on this experience, we present a design for and simulations of a novel protocol for voting in systems of this kind. It incorporates rate limitation and intrusion detection to ensure that even some very powerful adversaries attacking over many years have only a small probability of causing irrecoverable damage before being detected.
@article{1047917,
abstract = {The LOCKSS project has developed and deployed in a world-wide test a peer-to-peer system for preserving access to journals and other archival information published on the Web. It consists of a large number of independent, low-cost, persistent Web caches that cooperate to detect and repair damage to their content by voting in “opinion polls.” Based on this experience, we present a design for and simulations of a novel protocol for voting in systems of this kind. It incorporates rate limitation and intrusion detection to ensure that even some very powerful adversaries attacking over many years have only a small probability of causing irrecoverable damage before being detected.},
added-at = {2007-07-06T08:53:13.000+0200},
address = {New York, NY, USA},
author = {Maniatis, Petros and Roussopoulos, Mema and Giuli, T. J. and Rosenthal, David S. H. and Baker, Mary},
biburl = {https://www.bibsonomy.org/bibtex/2f142781c02dbd966355ca02bc353f7d5/ch},
description = {The LOCKSS peer-to-peer digital preservation system},
doi = {http://doi.acm.org/10.1145/1047915.1047917},
interhash = {9a311e930b14ab481cf40522ac526110},
intrahash = {f142781c02dbd966355ca02bc353f7d5},
issn = {0734-2071},
journal = {ACM Trans. Comput. Syst.},
keywords = {drm langzeitarchivierung openaccess p2p},
number = 1,
pages = {2--50},
publisher = {ACM Press},
timestamp = {2007-07-06T08:53:13.000+0200},
title = {The LOCKSS peer-to-peer digital preservation system},
url = {http://portal.acm.org/citation.cfm?id=1047917&coll=Portal&dl=ACM&CFID=27628983&CFTOKEN=96340807#},
volume = 23,
year = 2005
}