Peer-to-peer data trading to preserve information
- 1 April 2002
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 20 (2) , 133-170
- https://doi.org/10.1145/506309.506310
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- An adaptive data replication algorithmACM Transactions on Database Systems, 1997
- Ensuring the Longevity of Digital DocumentsScientific American, 1995
- Disconnected operation in the Coda File SystemACM Transactions on Computer Systems, 1992
- A case for redundant arrays of inexpensive disks (RAID)Published by Association for Computing Machinery (ACM) ,1988
- Andrew: a distributed personal computing environmentCommunications of the ACM, 1986
- Optimal File Allocation in a Multiple Computer SystemIEEE Transactions on Computers, 1969