Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
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
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
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
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
A cooperative internet backup scheme
ATEC '03 Proceedings of the annual conference on USENIX Annual Technical Conference
Finding similar files in a large file system
WTEC'94 Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference
Comparing the performance of distributed hash tables under churn
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Sauvegarde coopérative entre pairs pour dispositifs mobiles
UbiMob '05 Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing
iDIBS: An Improved Distributed Backup System
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
A secure peer-to-peer backup system
NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
Using a file working set model to speed up the recovery of Peer-to-Peer backup systems
ACM SIGOPS Operating Systems Review
Efficient maintenance of distributed data in highly dynamic opportunistic grids
Proceedings of the 2009 ACM symposium on Applied Computing
Churn-Resilient Replication Strategy for Peer-to-Peer Distributed Hash-Tables
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Optimizing peer-to-peer backup using lifetime estimations
Proceedings of the 2009 EDBT/ICDT Workshops
Highly available component sharing in large-scale multi-tenant cloud systems
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
N-party BAR Transfer: motivation, definition, and challenges
Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
A Read-Only Distributed Hash Table
Journal of Grid Computing
Better safe than sorry: backup your backups
XRDS: Crossroads, The ACM Magazine for Students - The Role of Academia in the Startup World
Contextual Trust Aided Enhancement of Data Availability in Peer-to-Peer Backup Storage Systems
Journal of Network and Systems Management
RelaxDHT: A churn-resilient replication strategy for peer-to-peer distributed hash-tables
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Hi-index | 0.01 |
Backup is cumbersome. To be effective, backups have to be made at regular intervals, forcing users to organize and store a growing collection of backup media. In this paper we propose a novel Peer-to-Peer backup system, PeerStore, that allows the user to store his backups on other peopleýs computers instead. PeerStore is an adaptive, cost-effective system suitable for all types of networks ranging from LAN, WAN to large unstable networks like the Internet. The system consists of two layers: metadata layer and symmetric trading layer. Locating blocks and duplicate checking is accomplished by the metadata layer while the actual data distribution is done between pairs of peers after they have established a symmetric data trade. By decoupling the metadata management from data storage, the system offers a significant reduction of the maintenance cost and preserves fairness among peers. Results show that PeerStore has a reduced maintenance cost comparing to pStore. PeerStore also realizes fairness because of the symmetric nature of the trades.