这是indexloc提供的服务,不要输入任何密码
Skip to main content

Conservation vs. Consensus in Peer-to-Peer Preservation Systems

  • Conference paper
Peer-to-Peer Systems IV (IPTPS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3640))

Included in the following conference series:

  • 1715 Accesses

  • 4 Citations

Abstract

The problem of digital preservation is widely acknowledged, but the underlying assumptions implicit to the design of systems that address this problem have not been analyzed explicitly. We identify two basic approaches to address the problem of digital preservation using peer-to-peer systems: conservation and consensus. We highlight the design tradeoffs involved in using the two general approaches, and we provide a framework for analyzing the characteristics of peer-to-peer preservation systems in general. In addition, we propose a novel conservation-based protocol for achieving preservation and we analyze its effectiveness with respect to our framework.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. ARL – Association of Research Libraries. ARL Statistics 2000-01 (2001), http://www.arl.org/stats/arlstat/01pub/intro.html

  2. Burkard, T.: Herodotus: A Peer-to-Peer Web Archival System, Master’s thesis, MIT (June 2002)

    Google Scholar 

  3. Cooper, B.F., Garcia-Molina, H.: Peer-to-peer data preservation through storage auctions. IEEE Transactions on Parallel and Distributed Systems (to appear)

    Google Scholar 

  4. Cox, L.P., Noble, B.D.: Samsara: Honor Among Thieves in Peer-to-Peer Storage. In: Proceedings of the Nineteenth ACM Symposium on Operating Systems Principles, Bolton Landing, NY, USA, October 2003, pp. 120–132 (2003)

    Google Scholar 

  5. Douceur, J.: The Sybil Attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 251. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. HiveCache, Inc. Distributed disk-based backups, Available at http://www.hivecache.com/

  7. Maniatis, P., Roussopoulos, M., Giuli, T.J., Rosenthal, D.S.H., Baker, M., Muliadi, Y.: Preserving Peer Replicas By Rate-Limited Sampled Voting. In: SOSP (2003)

    Google Scholar 

  8. Parno, B., Roussopoulos, M.: Predicting Adversary Infiltration in the LOCKSS System. Technical Report TR-28-04, Harvard University (October 2004)

    Google Scholar 

  9. Rosenthal, D.S.H., Roussopoulos, M., Maniatis, P., Baker, M.: Economic Measures to Resist Attacks on a Peer-to-Peer Network. In: Workshop on Economics of Peer-to-Peer Systems, Berkeley, CA, USA (June 2003)

    Google Scholar 

  10. Roussopoulos, M., Giuli, T.J., Baker, M., Maniatis, P., Rosenthal, D.S.H., Mogul, J.: 2 P2P or Not 2 P2P? In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 33–43. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Wallach, D.: A Survey of Peer-to-Peer Security Issues. In: Intl. Symp. on Software Security (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bungale, P.P., Goodell, G., Roussopoulos, M. (2005). Conservation vs. Consensus in Peer-to-Peer Preservation Systems. In: Castro, M., van Renesse, R. (eds) Peer-to-Peer Systems IV. IPTPS 2005. Lecture Notes in Computer Science, vol 3640. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11558989_22

Download citation

  • DOI: https://doi.org/10.1007/11558989_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29068-1

  • Online ISBN: 978-3-540-31906-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Publish with us

Policies and ethics