A quantitative comparison of reputation systems in the grid
- 1 January 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21521085,p. 8 pp.
- https://doi.org/10.1109/grid.2005.1542748
Abstract
Reputation systems have been a hot topic in the peer-to-peer community for several years. In a services-oriented distributed computing environment like the grid, reputation systems can be utilized by clients to select between competing service providers. In this paper, we selected several existing reputation algorithms and adapted them to the problem of service selection in a grid-like environment. We performed a quantitative comparison of both the accuracy and overhead associated with these techniques under common scenarios. The results indicate that using a reputation system to guide service selection can significantly improve client satisfaction with minimal overhead. In addition, we show that the most appropriate algorithm depends on the kinds of anticipated attacks. A new algorithm we've proposed appears to be the approach of choice if clients can misreport service ratings.Keywords
This publication has 6 references indexed in Scilit:
- Self-policing mobile ad hoc networks by reputation systemsIEEE Communications Magazine, 2005
- Uncheatable grid computingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Evolving and managing trust in grid computing systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The Eigentrust algorithm for reputation management in P2P networksPublished by Association for Computing Machinery (ACM) ,2003
- A reputation-based approach for choosing reliable resources in peer-to-peer networksPublished by Association for Computing Machinery (ACM) ,2002
- Managing trust in a peer-2-peer information systemPublished by Association for Computing Machinery (ACM) ,2001