Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Managing trust in a peer-2-peer information system
Proceedings of the tenth international conference on Information and knowledge management
On the reduction of broadcast redundancy in mobile ad hoc networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
PAST: A Large-Scale, Persistent Peer-to-Peer Storage Utility
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
TrustMe: Anonymous Management of Trust Relationships in Decentralized P2P Systems
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Trust and Reputation Model in Peer-to-Peer Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Neural Network-Based Reputation Model in a Distributed System
CEC '04 Proceedings of the IEEE International Conference on E-Commerce Technology
A trust model of p2p system based on confirmation theory
ACM SIGOPS Operating Systems Review
Ivy: a read/write peer-to-peer file system
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
Trusted P2P Transactions with Fuzzy Reputation Aggregation
IEEE Internet Computing
Fuzzy Trust for Peer-to-Peer Systems
ICDCSW '06 Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems
Hi-index | 0.01 |
Managing data is a problem of particular importance in trust model of peer-to-peer environments where one frequently encounters unknown agents. Existing methods for data management, which are based on DHT or Random Selection, can not apply well in the unstructured Peer-to-Peer system. They do not scale as they either require additional overhead on maintaining DHT or rely on a central database. In this paper we present an approach that manages trust data through constructing Trust Relationship Network. We quantify performance in terms of number of hits, network overhead, and response time. We use locally maintained network information and former interactions with other peers to improve the performance of searching. We present extensive experimental evaluations to demonstrate the performance of our proposed solution.