Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Erasure Coding Vs. Replication: A Quantitative Comparison
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Towards an Archival Intermemory
ADL '98 Proceedings of the Advances in Digital Libraries Conference
Erasure Code Replication Revisited
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Data durability in peer to peer storage systems
CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
High availability, scalable storage, dynamic peer networks: pick two
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
Total recall: system support for automated availability management
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
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 Centralized versus Distributed Recovery Schemes in P2P Storage Systems
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
A realistic simulation model for peer-to-peer storage systems
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Hybrid approaches for distributed storage systems
Globe'11 Proceedings of the 4th international conference on Data management in grid and peer-to-peer systems
| Hi-index | 0.00 |
This paper evaluates the performance of two schemes for recovering lost data in a peer-to-peer (P2P) storage systems. The first scheme is centralized and relies on a server that recovers multiple losses at once, whereas the second one is distributed. By representing the state of each scheme by an absorbing Markov chain, we are able to compute their performance in terms of the delivered data lifetime and data availability. Numerical computations are provided to better illustrate the impact of each system parameter on the performance. Depending on the context considered, we provide guidelines on how to tune the system parameters in order to provide a desired data lifetime.