Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
Reputation-based policies that provide the right incentives in peer-to-peer environments
Computer Networks: The International Journal of Computer and Telecommunications Networking - Management in peer-to-peer systems
A reputation mechanism for layered communities
ACM SIGecom Exchanges
PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing
IEEE Transactions on Parallel and Distributed Systems
Trust-based security for wireless ad hoc and sensor networks
Computer Communications
DynamicTrust: three-dimensional dynamic computing model of trust in peer-to-peer networks
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Reputation-based policies that provide the right incentives in peer-to-peer environments
Computer Networks: The International Journal of Computer and Telecommunications Networking - Management in peer-to-peer systems
A multi-dimensional trust evaluation model for large-scale P2P computing
Journal of Parallel and Distributed Computing
Improving reputation systems for wireless sensor networks using genetic algorithms
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Detecting bad-mouthing attacks on reputation systems using self-organizing maps
CISIS'11 Proceedings of the 4th international conference on Computational intelligence in security for information systems
Cooperation through reciprocity in multiagent systems: an evolutionary analysis
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Uncheatable reputation for distributed computation markets
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
Optimizing an incentives' mechanism for truthful feedback in virtual communities
AP2PC'05 Proceedings of the 4th international conference on Agents and Peer-to-Peer Computing
Handling free riders in peer-to-peer systems
AP2PC'05 Proceedings of the 4th international conference on Agents and Peer-to-Peer Computing
DHTrust: a robust and distributed reputation system for trusted peer-to-peer networks
Concurrency and Computation: Practice & Experience
Hi-index | 0.00 |
Peer-to-peer environments have become popular as a framework for exchange of services. In these environments, certain peers may fail to provide. their services.. Reputation can be a proper means of discovering low-performing peers, without affecting significantly inherent characteristics of peer-to-peer environments, such as anonymity and privacy. However, the accurate calculation of the reputation metrics may not be sufficient to provide the right incentives to peers. In this paper, we show that the straightforward approach for peers to exploit the reputation metrics (i.e. by just selecting as a providing peer the one with the highest reputation) may lead to unexpectedly low efficiency for high-performing peers. We argue and justify experimentally that the calculation of the reputation values has to be complemented by reputation-based policies that define the pairs of peers eligible to interact. We introduce two orthogonal dimensions constituting the reputation based policies: provider selection and contention resolution. We argue and show by means of simulation experiments that both these dimensions have a significant impact to the achieved efficiency of the peers. We also investigate experimentally the achievable efficiency of specific reputation-based policies for the case of short-lived peers of two different fixed-strategy types. Finally, we deal with the efficient computation of the reputation value by means of aggregation of the ratings feedback provided by the peers. We propose that this can be accomplished by aggregating only a small randomly selected subset of this feedback. Simulation experiments indicate that this approach indeed leads to the fast and accurate calculation of the reputation values even if the peer-to-peer population is renewed with a high rate.