The LOCKSS peer-to-peer digital preservation system
被引:87
|
作者:
Maniatis, P
论文数: 0引用数: 0
h-index: 0
机构:Intel Res, Berkeley, CA 94704 USA
Maniatis, P
Roussopoulos, M
论文数: 0引用数: 0
h-index: 0
机构:Intel Res, Berkeley, CA 94704 USA
Roussopoulos, M
Giuli, TJ
论文数: 0引用数: 0
h-index: 0
机构:Intel Res, Berkeley, CA 94704 USA
Giuli, TJ
Rosenthal, DSH
论文数: 0引用数: 0
h-index: 0
机构:Intel Res, Berkeley, CA 94704 USA
Rosenthal, DSH
论文数: 引用数:
h-index:
机构:
Baker, M
机构:
[1] Intel Res, Berkeley, CA 94704 USA
[2] Harvard Univ, Cambridge, MA 02138 USA
[3] Stanford Univ, Dept Comp Sci, Stanford, CA 94305 USA
[4] Stanford Univ Libraries, Stanford, CA USA
[5] HP Labs, Palo Alto, CA 94304 USA
来源:
ACM TRANSACTIONS ON COMPUTER SYSTEMS
|
2005年
/
23卷
/
01期
关键词:
design;
economics;
reliability;
rate limiting;
replicated storage;
digital preservation;
D O I:
10.1145/1047915.1047917
中图分类号:
TP301 [理论、方法];
学科分类号:
081202 ;
摘要:
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.