Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.