Creating trading networks of digital archives
- 1 January 2001
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 353-362
- https://doi.org/10.1145/379437.379727
Abstract
Digital archives can best survive failures if they have made several c opies of their collections at remote sites. In this paper, we discuss how autonomous sites can cooperate to provide preservation by trading data. We examine the decisions that an archive must make when forming trading networks, such as the amount of storage space to provide and the best number of partner sites. We also deal with the fact that some sites may be more reliable than others. Experimental results from a data trading simulator illustrate which policies are most reliable. Our techniques focus on preserving the ``bits'' of digital collections; other services that focus on other archiving concerns (such as preserving meaningful metadata) can be built on top of the system we describe here.Keywords
This publication has 13 references indexed in Scilit:
- Collection-based persistent archivesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Digital Rosetta Stone: a conceptual model for maintaining long-term access to digital documentsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An adaptive data replication algorithmACM Transactions on Database Systems, 1997
- PetalPublished by Association for Computing Machinery (ACM) ,1996
- The dangers of replication and a solutionPublished by Association for Computing Machinery (ACM) ,1996
- Ensuring the Longevity of Digital DocumentsScientific American, 1995
- Disconnected operation in the Coda File SystemACM Transactions on Computer Systems, 1992
- Replication in the harp file systemPublished by Association for Computing Machinery (ACM) ,1991
- A case for redundant arrays of inexpensive disks (RAID)ACM SIGMOD Record, 1988
- Andrew: a distributed personal computing environmentCommunications of the ACM, 1986