OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Erasure Coding Vs. Replication: A Quantitative Comparison
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
PAST: A Large-Scale, Persistent Peer-to-Peer Storage Utility
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Samsara: honor among thieves in peer-to-peer storage
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Erasure Code Replication Revisited
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
BOINC: A System for Public-Resource Computing and Storage
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Analysis of resource transfers in peer-to-peer file sharing applications using fluid models
Performance Evaluation - P2P computing systems
Understanding churn in peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
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
Efficient replica maintenance for distributed storage systems
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Exploiting availability prediction in distributed systems
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Performance analysis of BitTorrent-like systems with heterogeneous users
Performance Evaluation
Design and evaluation of distributed wide-area on-line archival storage systems
Design and evaluation of distributed wide-area on-line archival storage systems
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Modeling Heterogeneous User Churn and Local Resilience of Unstructured P2P Networks
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Proactive replication in distributed storage systems using machine availability estimation
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Characterizing unstructured overlay topologies in modern P2P file-sharing systems
IEEE/ACM Transactions on Networking (TON)
PeerSoN: P2P social networking: early experiences and insights
Proceedings of the Second ACM EuroSys Workshop on Social Network Systems
A Queuing Model for Evaluating the Transfer Latency of Peer-to-Peer Systems
IEEE Transactions on Parallel and Distributed Systems
High availability in DHTs: erasure coding vs. replication
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Safebook: A privacy-preserving online social network leveraging on real-life trust
IEEE Communications Magazine
Off-line incentive mechanism for long-term P2P backup storage
Computer Communications
F2Box: Cloudifying F2F Storage Systems with High Availability Correlation
CLOUD '12 Proceedings of the 2012 IEEE Fifth International Conference on Cloud Computing
FriendBox: A Hybrid F2F Personal Storage Application
CLOUD '12 Proceedings of the 2012 IEEE Fifth International Conference on Cloud Computing
Availability-Based Methods for Distributed Storage Systems
SRDS '12 Proceedings of the 2012 IEEE 31st Symposium on Reliable Distributed Systems
| Hi-index | 0.00 |
Peer-to-peer (P2P) storage systems aggregate spare storage resources from end users to build a large collaborative online storage solution. In these systems, however, the high levels of user churn-peers failing or leaving temporarily or permanently-affect the quality of the storage service and might put data reliability on risk. Indeed, one of the main challenge of P2P storage systems has traditionally been how to guarantee that stored data can always be retrieved within some time frame. To meet this challenge, existing systems store objects with high amounts of data redundancy, rendering data availability values close to 100%, which in turn ensure optimal retrieval times (only constrained by network limits). Unfortunately, this redundancy reduces the overall net capacity of the system and increases data maintenance costs. To alleviate these problems data redundancy can be reduced at the expense of lengthening retrieval times. The problem is that both the rewards and disadvantages of doing so are not well understood. In this paper we present a novel analytical framework that allows us to model retrieval times in P2P storage systems and describe the interplay between data redundancy and retrieval times for different churn patterns. Using availability traces from real P2P applications, we show that our framework provides accurate estimation of retrieval times in realistic environments.