Abstract
Peer-to-peer systems are foreseen as an efficient solution to achieve reliable data storage at low cost. To deal with common P2P problems such as peer failures or churn, such systems encode the user data into redundant fragments and distribute them among peers. The way they distribute it, known as placement policy, has a significant impact on their behavior and reliability. In this paper, we study the impact of different placement policies on the data life time. More precisely, we describe methods to compute and approximate the mean time before the system loses data (Mean Time to Data Loss). We compare this metric for three placement policies: two of them local, in which the data is stored in logical peer neighborhoods, and one of them global in which fragments are parted uniformly at random among the different peers.
This work was partially funded by the ANR project SPREADS and région PACA.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bhagwan, R., Tati, K., chung Cheng, Y., Savage, S., Voelker, G.M.: Total recall: System support for automated availability management. In: Proc. of NSDI, pp. 337–350 (2004)
Caron, S., Giroire, F., Mazauric, D., Monteiro, J., Pérennes, S.: P2P Storage Systems: Data Life Time for Different Placement Policies. Research Report RR-7209, INRIA (February 2010), http://hal.inria.fr/inria-00458190/en/
Chun, B.-G., Dabek, F., Haeberlen, A., Sit, E., Weatherspoon, H., Kaashoek, M.F., Kubiatowicz, J., Morris, R.: Efficient replica maintenance for distributed storage systems. In: Proc. of the NSDI’06, Berkeley, CA, USA, pp. 45–58. USENIX Association (2006)
Dabek, F., Li, J., Sit, E., Robertson, J., Kaashoek, M.F., Morris, R.: Designing a DHT for low latency and high throughput. In: Proc. of NSDI, San Francisco, USA, pp. 85–98 (2004)
De Bruijn, N.: A combinatorial problem. Kibern. Sb., Nov. Ser. 6, 33–40 (1969)
Douceur, J.R., Wattenhofer, R.P.: Large-scale simulation of replica placement algorithms for a serverless distributed file system. In: Proc. of MASCOTS, pp. 311–319 (2001)
Ghemawat, S., Gobioff, H., Leung, S.-T.: The google file system. In: 19th ACM Symposium on Operating Systems Principles (October 2003)
Giroire, F., Monteiro, J., Pérennes, S.: P2p storage systems: How much locality can they tolerate? In: Proc. of LCN’09, October 2009, pp. 320–323 (2009)
Grinstead, C.M., Snell, L.J.: Grinstead and Snell’s Introduction to Probability. American Mathematical Society (2006) (version dated July 4, 2006 edition)
Ktari, S., Zoubert, M., Hecker, A., Labiod, H.: Performance evaluation of replication strategies in dhts under churn. In: MUM ’07, pp. 90–97. ACM, New York (2007)
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Wells, C., et al.: OceanStore: an architecture for global-scale persistent storage. ACM SIGARCH Computer Architecture News 28(5), 190–201 (2000)
Lian, Q., Chen, W., Zhang, Z.: On the impact of replica placement to the reliability of distributed brick storage systems. In: Proc. of ICDCS’05, pp. 187–196 (2005)
Rowstron, A., Druschel, P.: Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility. In: Proc. ACM SOSP, pp. 188–201 (2001)
Weatherspoon, H., Kubiatowicz, J.: Erasure coding vs. replication: A quantitative comparison. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002, Part II. LNCS, vol. 2429, pp. 328–338. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caron, S., Giroire, F., Mazauric, D., Monteiro, J., Pérennes, S. (2010). Data Life Time for Different Placement Policies in P2P Storage Systems. In: Hameurlain, A., Morvan, F., Tjoa, A.M. (eds) Data Management in Grid and Peer-to-Peer Systems. Globe 2010. Lecture Notes in Computer Science, vol 6265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15108-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-15108-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15107-1
Online ISBN: 978-3-642-15108-8
eBook Packages: Computer ScienceComputer Science (R0)