Data Life Time for Different Placement Policies in P2P Storage Systems

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.

Content¶

	Paper
	10.1007/978-3-642-15108-8_7

BibTex¶

@inproceedings{caron2010globe,
  title = {Data life time for different placement policies in P2P storage systems},
  author = {Caron, St{\'e}phane and Giroire, Fr{\'e}d{\'e}ric and Mazauric, Dorian and Monteiro, Julian and P{\'e}rennes, St{\'e}phane},
  booktitle = {Proceedings of the Third International Conference on Data Management in Grid and Peer-to-Peer Systems},
  year = {2010},
  pages = {75--88},
  publisher = {Springer},
  doi = {10.1007/978-3-642-15108-8_7},
}