Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Introduction to algorithms
SimRank: a measure of structural-context similarity
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Efficient Epidemic-Style Protocols for Reliable and Scalable Multicast
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Semantic Small World: An Overlay Network for Peer-to-Peer Search
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
IEEE Transactions on Knowledge and Data Engineering
Correctness of a gossip based membership protocol
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Gossip-based aggregation in large dynamic networks
ACM Transactions on Computer Systems (TOCS)
ARA: A Robust Audit to Prevent Free-Riding in P2P Networks
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Experience with an object reputation system for peer-to-peer filesharing
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Scalable Query Dissemination in XPeer
IDEAS '07 Proceedings of the 11th International Database Engineering and Applications Symposium
TRIBLER: a social-based peer-to-peer system: Research Articles
Concurrency and Computation: Practice & Experience - Recent Advances in Peer-to-Peer Systems and Security (P2P 2006)
Random walk with restart: fast solutions and applications
Knowledge and Information Systems
Lightweight Distributed Trust Propagation
ICDM '07 Proceedings of the 2007 Seventh IEEE International Conference on Data Mining
Simrank++: query rewriting through link analysis of the click graph
Proceedings of the VLDB Endowment
User interactions in social networks and their implications
Proceedings of the 4th ACM European conference on Computer systems
BarterCast: A practical approach to prevent lazy freeriding in P2P networks
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
A survey of attack and defense techniques for reputation systems
ACM Computing Surveys (CSUR)
Taxonomy of trust: Categorizing P2P reputation systems
Computer Networks: The International Journal of Computer and Telecommunications Networking - Management in peer-to-peer systems
Fast computation of SimRank for static and dynamic information networks
Proceedings of the 13th International Conference on Extending Database Technology
Towards pre-standardization of trust and reputation models for distributed and heterogeneous systems
Computer Standards & Interfaces
SuperTrust - a secure and efficient framework for handling trust in super peer networks
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Empirical analysis of predictive algorithms for collaborative filtering
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
T-Man: gossip-based overlay topology management
ESOA'05 Proceedings of the Third international conference on Engineering Self-Organising Systems
SybilRes: A Sybil-resilient Flow-Based Decentralized Reputation Mechanism
ICDCS '12 Proceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems
Hi-index | 0.00 |
In online reputation mechanisms, providing the system participants (peers) with the appropriate information on previous interactions is crucial for accurate reputation evaluations. A naive way of doing so is to provide all peers with all information, regardless of whether they need it or not, which may be very costly and not scalable. In this paper we propose a similarity-based approach, named SimilDis, for targeted dissemination of information in the distributed reputation mechanism called BarterCast. In BarterCast, each peer collects information on the interactions (data transfers) that have occurred in the system, and builds a weighted directed graph that represents its partial view of the system. We propose two methods to derive peer similarity in the partial graph of a peer. The first method is based on incrementally maintaining a directed acyclic graph, and the second method is based on performing multiple nonuniform random walks in the partial graph. In both methods, each peer maintains a list of the peers most similar to itself, and gives higher priority to them when disseminating information. We evaluate the accuracy and the cost of these methods using trace-driven simulations based on traces from the Tribler P2P file-sharing network, which employs BarterCast. As the results show, both methods exhibit very small errors in the computed reputations in comparison with the case of providing complete knowledge to all peers, but decrease the communication and storage costs by two orders of magnitude.