Skip to main content

High Availability Data Model for P2P Storage Network

  • Conference paper
  • 1518 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6488))

Abstract

With the goal to provide high data availability, replicas of data will be distributed based on the idea of threshold, meaning that data service is guaranteed to be available so long as any k out of n peers are online. The key distribution algorithm of the model as well as its scalability, management, and other availability-related factors are presented and analyzed.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   89.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cuenca-Acuna, F.M., Peery, C., Martin, R.P., Nguyen, T.D.: PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities. In: Proceedings of the IEEE International Symposium on High Performance Distributed Computing (2003)

    Google Scholar 

  2. Kubiatowicz, J., Bindel, D., Chen, Y., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: Oceanstore: An Architecture for Global-Scale Persistent Storage. In: Proceedings of ACM ASPLOS Conference (2000)

    Google Scholar 

  3. Liu, X.Z., Yang, G.W., Wang, D.X.: Stationary and Adaptive Replication Approach to Data Availability in Structured Peer-to-Peer Overlay Networks. In: Proceedings of the 11th IEEE International Conference on Networks (2003)

    Google Scholar 

  4. Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and Replication in Unstructured Peer-to-Peer Networks. In: Proceedings of the 16th ACM International Conference on Supercomputing, New York (June 2002)

    Google Scholar 

  5. Ray, S., Francis, P., Handey, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proceedings of the ACM SIGCOMM Conference (2001)

    Google Scholar 

  6. Rowstran, A., Druschel, P.: Storage Management and Caching in PAST, a Large-Scale, Persistent Peer-to-Peer Storage Utility. In: Proceedings of ACM Symposium on Operating Systems Principles (October 2001)

    Google Scholar 

  7. Shamir, A.: How to Share a Secret. Communications of the ACM 22(11), 612–613 (1979)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, B., Chi, CH., Liu, C., Xie, Z., Ding, C. (2010). High Availability Data Model for P2P Storage Network. In: Chen, L., Triantafillou, P., Suel, T. (eds) Web Information Systems Engineering – WISE 2010. WISE 2010. Lecture Notes in Computer Science, vol 6488. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17616-6_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17616-6_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17615-9

  • Online ISBN: 978-3-642-17616-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics