Peer-to-Peer Storage Systems: A Practical Guideline to be Lazy

Distributed and peer-to-peer storage systems are foreseen as an alternative to the traditional data centers and in-house backup solutions. In the past few years many peerto-peer storage systems have been proposed. Most of them rely on the use of erasure codes to introduce redundancy to the data. This kind of system depends on many parameters that need to be well tuned, such as the factor of redundancy, the frequency of data repair and the size of a data block. In this paper we give closed-form mathematical expressions that estimate the system average behavior. These expressions are derived from a Markov chain. Our contribution is a guideline to system designers and administrators to choose the best set of parameters. That is, how to tune the system parameters to obtain a desired level of reliability under a given constraint of bandwidth consumption. We confirm that a lazy repair strategy can be employed to amortize the repairing cost. Moreover, we propose a formula to calculate the opt...

• Type: Journal
• Year: 2010
• Where: GLOBECOM
• Authors: Frédéric Giroire, Julian Monteiro, Stéphane Pérennes
• Keywords: Bandwidth Consumption, Communications, GLOBECOM 2010, Lazy Repair, Storage Systems