Proactive replication in distributed storage systems using machine availability estimation
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
A Study of Reconstruction Process Load in P2P Storage Systems
Globe '08 Proceedings of the 1st international conference on Data Management in Grid and Peer-to-Peer Systems
Performance analysis of peer-to-peer storage systems
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Maintaining data reliability without availability in P2P storage systems
Proceedings of the 2010 ACM Symposium on Applied Computing
Using Monte Carlo simulation for improving data availability in P2P network
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
A quantitative analysis of redundancy schemes for peer-to- peer storage systems
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Off-line incentive mechanism for long-term P2P backup storage
Computer Communications
| Hi-index | 0.00 |
In this paper we present a quantitative study of data survival in peer to peer storage systems. We first recall two main redundancy mechanisms: replication and erasure codes, which are used by most peer to peer storage systems like OceanStore, PAST or CFS, to guarantee data durability. Second we characterize peer to peer systems according to a volatility factor (a peer is free to leave the system at anytime) and to an availability factor (a peer is not permanently connected to the system). Third we model the behavior of a system as a Markov chain and analyse the average life time of data (MTTF) according to the volatility and availability factors. We also present the cost of the repair process based on these redundancy schemes to recover failed peers. The conclusion of this study is that when there is no high availability of peers, a simple replication scheme may be more efficient than sophisticated erasure codes.