Peer-to-peer data trading to preserve information

被引:29
作者
Cooper, BF [1 ]
Garcia-Molina, H [1 ]
机构
[1] Stanford Univ, Dept Comp Sci, Stanford, CA 94305 USA
关键词
design; reliability; data replication; digital archiving; digital library; fault tolerance; resource negotiation;
D O I
10.1145/506309.506310
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Data archiving systems rely on replication to preserve information. This paper discusses how a network of autonomous archiving sites can trade data to achieve the most reliable replication. A series of binary trades among sites produces a peer-to-peer archiving network. Two trading algorithms are examined, one based on trading collections (even if they are different sizes) and another based on trading equal sized blocks of space (which can then store collections). The concept of deeds is introduced; deeds track the blocks of space owned by one site at another. Policies for tuning these algorithms to provide the highest reliability, for example by changing the order in which sites are contacted and offered trades, are discussed. Finally, simulation results are presented that reveal which policies are best. The experiments indicate that a digital archive can achieve the best reliability by trading blocks of space (deeds), and that following certain policies will allow that site to maximize its reliability.
引用
收藏
页码:133 / 170
页数:38
相关论文
共 31 条
[1]  
[Anonymous], PRESERVING DIGITAL I
[2]  
[Anonymous], SCI AM
[3]  
[Anonymous], 2000, P ASPLOS
[4]  
BASTANI FB, 1987, P ICDE
[5]  
BEAGRIE N, 1998, P 6 DELOS WORKSH PRE
[6]  
Borr A., 1981, P 7 VLDB
[7]  
CHEN Y, 1999, P ACM INT C DIG LIB
[8]   OPTIMAL FILE ALLOCATION IN A MULTIPLE COMPUTER SYSTEM [J].
CHU, WW .
IEEE TRANSACTIONS ON COMPUTERS, 1969, C 18 (10) :885-&
[9]  
COOPER B, 2000, LNCS, V1923
[10]  
COOPER BF, 2001, P 1 JOINT ACM IEEE C