Abstract
This paper discusses how to building high available storage systems on top of peer-to-peer infrastructure. We first demonstrate that traditional definitions of availability are not suitable for distributed systems. Then the application-specific availability is defined and analyzed in this paper. We observed by experiments that, in a P2P storage system with frequently node join and leave, availability can’t be improved effectively by pure redundancy (replication or erasure coding). A method is proposed in this paper which combines peer auto-selection and redundancy to effectively improve the availability of P2P storage systems.
This work is supported by the National Natural Science Foundation of China under Grant 60173007 and the National High Technology Development Program of China under Grant 2001AA111080.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bhagwan, R., Savage, S., Voelker, G.M.: Understanding Availability. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)
Brown, A., Patterson, D.A.: Towards Availability Benchmarks: A Case Study of Software RAID Systems. In: Proceedings of the 2000 USENIX Annual Technical Conference, San Diego, CA (June 2000)
Dabek, F., Kaashoek, M.F., Karger, D., et al.: Wide-area cooperative storage with CFS. In: Proc. ACM SOSP 2001, Banff, Canada (October 2001)
Dusseau, R.A.: Performance Availability for Networks of Workstations. Ph.D. Dissertation, U.C. Berkeley (December 1999)
Kubiatowicz, J., Bindel, D., Chen, Y., et al.: OceanStore: An Architecture for Global- Scale Persistent Storage. In: Proceedings of the Ninth international Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2000 (2000)
KaZaA website, http://www.kazaa.com
Luby, M., Mitzenmacher, M., Shokrollahi, M., et al.: Analysis of low density codes and improved designs using irregular graphs. In: Proc. of ACM STOC (May 1998)
Overnet website, http://www.overnet.com
Plank, J.: A tutorial on reed-solomon coding for fault tolerance in RAID-like systems. Software Practice and Experience 27(9), 995–1012 (1997)
Ratnasamy, S., et al.: A Scalable Content-Addressable Network. In: ACM SIGCOMM, San Diego, CA, USA (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for largescale peer-to-peer systems. In: IFIP/ACM Middleware, Heidelberg, Germany (2001)
Rowstron, A., Druschel, P.: Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In: Proceedings of ACM SOSP 2001 (2001)
Saroiu, S., Gummadi, P.K., Gribble, S.D.: A Measurement Study of Peer-to-Peer File Sharing Systems. In: Proceedings of the Multimedia Computing and Networking (MMCN), San Jose (January 2002)
Stoica, I., et al.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: ACM SIGCOMM, San Diego, CA, USA (2001)
Yang, B., Molina, H.G.: Designing a Super-Peer Network. In: ICDE 2003 (2003)
Zhang, Z., Shi, S., Zhu, J.: SOMO: self-organized metadata overlay for resource management in P2P DHT. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)
Zhao, B.Y., Kubiatowicz, J.D., Josep, A.D.: Tapestry: An infrastructure for faulttolerant wide-area location and routing. Tech. Rep. UCB/CSD-01-1141, UC Berkeley, EECS (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shi, S., Yang, G., Yu, J., Wu, Y., Wang, D. (2003). Improving Availability of P2P Storage Systems. In: Zhou, X., Xu, M., Jähnichen, S., Cao, J. (eds) Advanced Parallel Processing Technologies. APPT 2003. Lecture Notes in Computer Science, vol 2834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39425-9_53
Download citation
DOI: https://doi.org/10.1007/978-3-540-39425-9_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20054-3
Online ISBN: 978-3-540-39425-9
eBook Packages: Springer Book Archive