Reputation estimation and query in peer-to-peer networks
Gary Chan, S.-H.
|Source||IEEE Communications Magazine , v. 48, (4), 2010, p. 122-127|
|Summary||Many peer-to-peer systems assume that peers are cooperative to share and relay data. But in the open environment of the Internet, there may be uncooperative malicious peers. To detect malicious peers or reward well behaved ones, a reputation system is often used. In this article we give an overview of P2P reputation systems and investigate two fundamental issues in the design: reputation estimation and query. We classify the state-of-the-art approaches into several categories and study representative examples in each category. We also qualitatively compare them and outline open issues for future research. © 2010 IEEE.|
|Rights||© 2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.|
View full-text via DOI
View full-text via Scopus
Files in this item: