A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
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
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
A Computational Model of Trust and Reputation for E-businesses
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 7 - Volume 7
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Samsara: honor among thieves in peer-to-peer storage
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities
IEEE Transactions on Knowledge and Data Engineering
PeerStore: Better Performance by Relaxing in Peer-to-Peer Backup
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
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
TRAVOS: Trust and Reputation in the Context of Inaccurate Information Sources
Autonomous Agents and Multi-Agent Systems
Storage Allocation in Unreliable Peer-to-Peer Systems
DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
Towards a More Accurate Availability Evaluation
IWNAS '06 Proceedings of the 2006 International Workshop on Networking, Architecture, and Storages
The Effect of Replica Placement on Routing Robustness in Distributed Hash Tables
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
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
Minimizing churn in distributed systems
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Understanding churn in peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
A survey of trust and reputation systems for online service provision
Decision Support Systems
A cooperative internet backup scheme
ATEC '03 Proceedings of the annual conference on USENIX Annual Technical Conference
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
Non-transitive connectivity and DHTs
WORLDS'05 Proceedings of the 2nd conference on Real, Large Distributed Systems - Volume 2
PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing
IEEE Transactions on Parallel and Distributed Systems
Locality-Aware and Churn-Resilient Load-Balancing Algorithms in Structured Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
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
Friendstore: cooperative online backup using trusted nodes
Proceedings of the 1st Workshop on Social Network Systems
StereoTrust: a group based personalized trust model
Proceedings of the 18th ACM conference on Information and knowledge management
Finding Good Partners in Availability-Aware P2P Networks
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Redundancy Maintenance and Garbage Collection Strategies in Peer-to-Peer Storage Systems
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
Replica Placement in P2P Storage: Complexity and Game Theoretic Analyses
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
IEEE Transactions on Information Theory
Trust beyond reputation: A computational trust model based on stereotypes
Electronic Commerce Research and Applications
Building a reputation-based bootstrapping mechanism for newcomers in collaborative alert systems
Journal of Computer and System Sciences
| Hi-index | 0.00 |
Peer-to-peer storage services are a cost-effective alternative for data backup. A basic question that arises in the design of such systems is: In which peers do we store redundant data? Choosing appropmailriate peers for data backup is important at a microscopic level, from an end-user's perspective to guarantee good performance, e.g., quick access, high availability, etc., as well as at a macroscopic level, e.g., for system optimization, fairness, etc. Existing systems apply different techniques, including random selection, based on a distributed hash table (DHT) or based on the peers' past availability pattern. In this paper, we propose as an alternative, a contextual trust based data placement scheme to select suitable data holders. It is originally designed for and applicable to scenarios where there is inadequate historical information about peers, a common scenario in large-scale systems. Specifically, our scheme estimates trustworthiness of a peer based on stereotypes, formed by aggregating information of interactions with other (similar) peers. Simulation experiments show that our placement scheme outperforms not only random selection but also schemes using historical information, in terms of both achieved data availability as well as bandwidth overheads to sustain the system.