P2P Storage Systems: How Much Locality Can They Tolerate? - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

P2P Storage Systems: How Much Locality Can They Tolerate?


Large scale peer-to-peer systems are foreseen as a way to provide highly reliable data storage at low cost. To achieve high durability, such P2P systems encode the user data in a set of redundant fragments and distribute them among the peers. In this paper, we study the impact of different data placement strategies on the system performance when using erasure codes redundancy schemes. We compare three policies: two of them local, in which the data are stored in logical neighbors, and the other one global, in which the data are spread randomly in the whole system. We focus on the study of the probability to lose a data block and the bandwidth consumption to maintain enough redundancy. We use simulations to show that, without resource constraints, the average values are the same no matter which placement policy is used. However, the variations in the use of bandwidth are much more bursty under the local policies. When the bandwidth is limited, these bursty variations induce longer maintenance time and henceforth a higher risk of data loss. Finally, we propose a new external reconstruction strategy and a suitable degree of locality that could be introduced in order to combine the efficiency of the global policy with the practical advantages of a local placement.
Fichier principal
Vignette du fichier
GMP09.pdf (161.47 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00496220 , version 1 (29-06-2010)



Frédéric Giroire, Julian Monteiro, Stéphane Pérennes. P2P Storage Systems: How Much Locality Can They Tolerate?. IEEE Conference on Local Computer Networks (LCN), Oct 2009, Zurich, Switzerland. pp.320--323, ⟨10.1109/LCN.2009.5355104⟩. ⟨inria-00496220⟩
240 View
133 Download



Gmail Facebook Twitter LinkedIn More