The LOCKSS peer-to-peer digital preservation system

被引:87
作者
Maniatis, P
Roussopoulos, M
Giuli, TJ
Rosenthal, DSH
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.
引用
收藏
页码:2 / 50
页数:49
相关论文
共 48 条
[1]  
Abadi M., 2003, P 10 ANN NETW DISTR
[2]  
ANDERSON RJ, 1996, P 1 INT C THEOR APPL
[3]  
[Anonymous], P 18 ACM S OP SYST P
[4]  
*ARL, 2001, ARL STAT 2000 01
[5]  
BACK A, 2002, HASHCASH DENIAL SERV
[6]   Bimodal multicast [J].
Birman, KP ;
Hayden, M ;
Ozkasap, O ;
Xiao, Z ;
Budiu, M ;
Minsky, Y .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1999, 17 (02) :41-88
[7]   Practical byzantine fault tolerance and proactive recovery [J].
Castro, M ;
Liskov, B .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2002, 20 (04) :398-461
[8]  
Chen Y., 1999, Digital 99 Libraries. Fourth ACM Conference on Digital Libraries, P28, DOI 10.1145/313238.313249
[9]  
CHOR B, 1989, ADV COMPUTING RES, V5, P443
[10]  
Clarke I., 2001, LECT NOTES COMPUTER, V2009, P46, DOI [DOI 10.1007/3-540-44702-4, DOI 10.1007/3-540-44702-4_]