Practical loss-resilient codes
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Reperasure: Replication Protocol Using Erasure-Code in Peer-to-Peer Storage Network
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
PAST: A Large-Scale, Persistent Peer-to-Peer Storage Utility
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Pastiche: making backup cheap and easy
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
OpenDHT: a public DHT service and its uses
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Data durability in peer to peer storage systems
CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Internet-Scale Storage Systems under Churn -- A Study of the Steady-State using Markov Models
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
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
Efficient replica maintenance for distributed storage systems
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Proactive replication in distributed storage systems using machine availability estimation
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
P2P and cloud: a marriage of convenience for replica management
IWSOS'12 Proceedings of the 6th IFIP TC 6 international conference on Self-Organizing Systems
| Hi-index | 0.00 |
Peer-to-peer (P2P) storage is a promising technology to provide users with cheap and online persistence. However, due the instability of these infrastructures, P2P storage systems must introduce redundancy in order to guarantee a reliable storage service. Besides, they need data repair algorithms to maintain this redundancy in front of permanent node departures. To ensure that such repairs can always be run, existing P2P storage systems aim to maintain 100% data availability. Unfortunately, this solution seems to overkill in preventing data loses, introducing network and data overheads. In this paper we propose a new data repair algorithm able to guarantee a high reliable storage service without 100% data availability. The main idea is to ensure that objects are kept stored instead of maintaining them available. We analytically prove that our approach reduces considerably the total amount of redundancy. Moreover, through simulation, we show how our approach significantly reduces the required number of repairs, decreasing both, the network and the storage overheads.