skip to main content
article

Peer-to-peer data trading to preserve information

Published:01 April 2002Publication History
Skip Abstract Section

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.

References

  1. Bastani, F. B. and Yen, I.-L. 1987. A fault tolerant replicated storage system. In Proceedings of the ICDE.]] Google ScholarGoogle Scholar
  2. Beagrie, N. 1998. Developing a policy framework for digital preservation. In Proceedings of the 6th DELOS Workshop on Preservation of Digital Information.]]Google ScholarGoogle Scholar
  3. Borr, A. 1981. Transaction monitoring in Encompass {TM}: Reliable distributed transaction processing. In Proceedings of the 7th VLDB.]]Google ScholarGoogle Scholar
  4. Chen, Y., Edler, J., Goldberg, A. V., Gottlieb, A., Sobti, S., and Yianilos, P. N. 1999. A prototype implementation of archival intermemory. In Proceedings of the ACM International Conference on Digital Libraries.]] Google ScholarGoogle Scholar
  5. Chu, W. W. 1969. Multiple file allocation in a multiple computer system. IEEE Trans. Comput. C-18, 10 (Oct.), 885--889.]]Google ScholarGoogle Scholar
  6. Cooper, B., Crespo, A., and Garcia-Molina, H. 2000. Implementing a reliable digital object archive. In Proceedings of the European Conference on Digital Libraries (ECDL). In LNCS (Springer-Verlag) volume 1923.]] Google ScholarGoogle Scholar
  7. Cooper, B. and Garcia-Molina, H. 2001. Creating trading networks of digital archives. In Proceedings of the 1st Joint ACM/IEEE Conference on Digital Libraries (JCDL).]] Google ScholarGoogle Scholar
  8. Du, X. and Maryanski, F. 1988. Data allocation in a dynamically reconfigurable environment. In Proceedings of the ICDE.]] Google ScholarGoogle Scholar
  9. Fre. 2000. The Freenet Project. http://freenet.sourceforge.net/.]]Google ScholarGoogle Scholar
  10. Garrett, J. and Waters, D. 1996. Preserving digital information: Report of the Task Force on Archiving of Digital Information. Accessible at http://www.rlg.org/ArchTF/.]]Google ScholarGoogle Scholar
  11. Gnu. 2001. Gnutella. http://gnutella.wego.com.]]Google ScholarGoogle Scholar
  12. Goldberg, A. and Yianilos, P. 1998. Towards an archival intermemory. In Advances in Digital Libraries.]] Google ScholarGoogle Scholar
  13. Gray, J., Helland, P., O'Neal, P., and Shasha, D. 1996. The dangers of replication and a solution. In Proceedings of the SIGMOD.]] Google ScholarGoogle Scholar
  14. Heminger, A. and Robertson, S. 1998. Digital Rosetta Stone: A conceptual model for maintaining long-term access to digital documents. In Proceedings of the 6th DELOS Workshop on Preservation of Digital Information.]] Google ScholarGoogle Scholar
  15. Hindel, R. 1990. Image storage organization. In Proceedings of the 10th Symposium on Computer Applications in Radiology (SCAR).]]Google ScholarGoogle Scholar
  16. Hsiao, H. and DeWitt, D. 1990. Chained declustering: A new availability strategy for multiprocessor database machines. In Proceedings of the 6th ICDE.]] Google ScholarGoogle Scholar
  17. Kistler, J. J. and Satyanarayanan, M. 1992. Disconnected operation in the Coda file system. ACM Trans. Comput. Syst. 10, 1 (Feb.), 3--25.]] Google ScholarGoogle Scholar
  18. Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S. E., Eaton, P. R., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., and Zhao, B. Y. 2000. OceanStore: An architecture for global-scale persistent storage. In Proceedings of the ASPLOS.]] Google ScholarGoogle Scholar
  19. Lee, E. and Thekkath, C. 1996. Petal: Distributed virtual disks. In Proceedings of the 7th ASPLOS.]] Google ScholarGoogle Scholar
  20. Liskov, B., Ghemawat, S., Gruber, R., Johnson, P., Shrira, L., and Williams, M. 1991. Replication in the Harp file system. In Proceedings of the 13th SOSP.]] Google ScholarGoogle Scholar
  21. Loc. 2001. LOCKSS status. http://lockss.stanford.edu/projectstatus.htm.]]Google ScholarGoogle Scholar
  22. Maria, N., Gaspar, P., Ferreira, A., and Silva, M. 1998. Information preservation in ARIADNE. In Proceedings of the 6th DELOS Workshop on Preservation of Digital Information.]]Google ScholarGoogle Scholar
  23. Martello, S. and Toth, P. 1990. Knapsack Problems: Algorithms and Computer Implementations. J. Wiley and Sons, Chichester, New York.]] Google ScholarGoogle Scholar
  24. Morris, J. H., Satyanarayanan, M., Conner, M. H., Howard, J. H., Rosenthal, D. S. H., and Smith, F. D. 1986. Andrew: A distributed personal computing environment. Commun. ACM 29, 3 (March), 184--201.]] Google ScholarGoogle Scholar
  25. Patterson, D., Gibson, G., and Katz, R. H. 1988. A case for redundant arrays of inexpensive disks (RAID). SIGMOD Record 17, 3 (Sept.), 109--116.]] Google ScholarGoogle Scholar
  26. Rajasekar, A., Marciano, R., and Moore, R. 2000. Collection-based persistent archives. http://www.sdsc.edu/NARA/Publications/OTHER/Persistent/Persistent.html.]]Google ScholarGoogle Scholar
  27. Rosenthal, D. S. H. and Reich, V. 2000. Permanent web publishing. In Proceedings 2000 USENIX Annual Technical Conference.]] Google ScholarGoogle Scholar
  28. Rothenberg, J. 1995. Ensuring the longevity of digital documents. Scientific American 272, 1 (Jan.), 24--29.]]Google ScholarGoogle Scholar
  29. Sandhu, H. and Zhou, S. 1992. Cluster-based file replication in large-scale distributed systems. In Proceedings of SIGMETRICS.]] Google ScholarGoogle Scholar
  30. Taaffe, J., Kaldis, M., and Gahm, J. 1990. Q-RSTAR digital image management and transmission. In Proceedings of the 10th Symposium on Computer Applications in Radiology (SCAR).]]Google ScholarGoogle Scholar
  31. Wolfson, O., Jajodia, S., and Huang, Y. 1997. An adaptive data replication algorithm. ACM Trans. Database Syst. 2, 2 (June), 255--314.]] Google ScholarGoogle Scholar

Index Terms

  1. Peer-to-peer data trading to preserve information

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in

            Full Access

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader