The Community for Technology Leaders
RSS Icon
Issue No.09 - September (2008 vol.20)
pp: 1282-1295
Runfang Zhou , University of Southern California
Min Cai , University of Southern California
Abstract In peer-to-peer (P2P) networks, reputation aggregation and ranking are the most time-consuming and space-demanding operations. This paper proposes a new gossip protocol for fast score aggregation. We developed a Bloom filter architecture for efficient score ranking. These techniques do not require any secure hashing or fast lookup mechanism, thus are applicable to both unstructured and structured P2P networks. We report the design principles and performance results of a simulated GossipTrust reputation system. Randomized gossiping with effective use of power nodes enables light-weight aggregation and fast dissemination of global scores in O(log2 n) time steps, where n is the P2P network size. The Gossip-based protocol is designed to tolerate dynamic peer joining and departure, as well as to avoid possible peer collusions. The scheme has a considerably low gossiping message overhead, i.e. O(nlog2 n) messages for n nodes. Bloom filters demand at most 512 KB memory per node for a 10,000-node network. We evaluate the performance of GossipTrust with distributed P2P file-sharing and parameter-sweeping applications. The simulation results demonstrate that GossipTrust has small aggregation time, low memory demand, and high ranking accuracy. These results suggest promising advantages of using the GossipTrust system for trusted P2P applications.
Peer-to-peer networks, reputation system, information aggregation, Bloom filter, distributed file sharing, gossip communication, Distributed computing
Runfang Zhou, Min Cai, "GossipTrust for Fast Reputation Aggregation in Peer-to-Peer Networks", IEEE Transactions on Knowledge & Data Engineering, vol.20, no. 9, pp. 1282-1295, September 2008, doi:10.1109/TKDE.2008.48
[1] K. Aberer and Z. Despotovic, “Managing Trust in a Peer-2-Peer Information System,” Proc. ACM 10th Int'l Conf. Information and Knowledge Management (CIKM), 2001.
[2] S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, “Randomized Gossip Algorithms,” IEEE Trans. Information Theory, vol. 52, no. 6, pp. 2508-2530, June 2006.
[3] B.H. Bloom, “Space/Time Trade-Offs in Hash Coding with Allowable Errors,” Comm. ACM, vol. 13, no. 7, pp. 422-426, 1970.
[4] A. Broder and M. Mitzenmacher, “Network Applications of Bloom Filters: A Survey,” Proc. 40th Ann. Allerton Conf. Comm. Control and Computing, 2002.
[5] S. Buchegger and J.Y. Boudec, “A Robust Reputation System for P2P and Mobile Ad Hoc Networks,” Proc. Second Workshop Economics of P2P Systems, June 2004.
[6] K. Chen, K. Hwang, and G. Chen, “Heuristic Discovery of Role- Based Trust Chains in Peer-to-Peer Networks,” IEEE Trans. Parallel and Distributed Systems, preprint, 14 July 2008, .
[7] N. Christin, A.S. Weigend, and J. Chuang, “Content Availability, Pollution and Poisoning in File Sharing Peer-to-Peer Networks,” Proc. Sixth ACM Conf. Electronic Commerce, June 2005.
[8] E. Damiani, S. Vimercati, S. Paraboschi, and P. Samarati, “Managing and Sharing Servants' Reputations in P2P System,” IEEE Trans. Knowledge and Data Eng., vol. 15, no. 4, July/Aug. 2003.
[9] D. Dumitiu, E. Knightly, A. Kuzmanovic, I. Stoica, and W. Zwaenepoel, “Denial-of-Service Resilience in P2P File Sharing Systems,” Proc. ACM SIGMETRICS '05, June 2005.
[10] C. Gkantsidis, M. Mihail, and A. Saberi, “Conductance and Congestion in Power Law Graphs,” Proc. ACM SIGMETRICS '03, June 2003.
[11] K. Gummadi, R. Dunn, and R. Dunn, “Measurement, Modeling and Analysis of a Peer-to-Peer File-Sharing Workload,” Proc. 19th ACM Symp. Operating Systems Principles (SOSP), 2003.
[12] J. Hu and R. Klefstad, “Decentralized Load Balancing on Unstructured Peer-to-Peer Computing Grids,” Proc. Fifth IEEE Int'l Symp. Network Computing and Applications (NCA '06), July 2006.
[13] D. Hughes, G. Coulson, and J. Walkerdine, “Free Riding on Gnutella Revisited: The Bell Tolls,” IEEE Distributed Systems Online, vol. 6, June 2005.
[14] M. Jelasity, A. Montresor, and O. Babaoglu, “Gossip-Based Aggregation in Large Dynamic Networks,” ACM Trans. Computer Systems, vol. 23, no. 3, Aug. 2005.
[15] V. Kalogeraki, A. Delis, and D. Gunopulos, “Peer-to-Peer Architectures for Scalable, Efficient and Reliable Media Services,” Proc. 17th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '03), Apr. 2003.
[16] S. Kamvar, M. Schlosser, and H. Garcia-Molina, “The Eigentrust Algorithm for Reputation Management in P2P Networks,” Proc. 12th Int'l World Wide Web Conf. (WWW '03), May 2003.
[17] D. Kempe, A. Dobra, and J. Gehrke, “Gossip-Based Computation of Aggregate Information,” Proc. 44th Ann. IEEE Symp. Foundations of Computer Science (FOCS '03), Oct. 2003.
[18] Z. Liang and W. Shi, “Analysis of Recommendations on Trust Inference in Open Environment,” Performance Evaluation, vol. 65, no. 2, pp. 99-128, Feb. 2008.
[19] X. Lou and K. Hwang, “Proactive Poisoning to Stop Collusive Piracy in Peer-to-Peer File Sharing,” IEEE Trans. Computers, submitted for publication.
[20] S. Marti and H. Garcia-Molina, “Limited Reputation Sharing in P2P Systems,” Proc. Fifth ACM Conf. Electronic Commerce, May 2004.
[21] J. Meserve, “P2P Traffic Still Dominates the Net,” Network World, 2005.
[22] R.L. Page, S. Brin, and T. Winograd, “The Pagerank Citation Ranking: Bringing Order to the Web,” technical report, Stanford Digital Library Technologies Project, 1998.
[23] S. Nandy, L. Carter, and J. Ferrante, “GUARD: Gossip Used for Autonomous Resource Detection,” Proc. 19th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '05), Apr. 2005.
[24] G. Pallis and A. Vakali, “Insight and Perspectives for Content Delivery Networks,” Comm. ACM, pp. 101-106, Jan. 2006.
[25] D. Qiu and R. Srikant, “Modeling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks,” Proc. ACM SIGCOMM '04, Aug./Sept. 2004.
[26] P. Resnick, R. Zeckhauser, E. Friedman, and K. Kuwabra, “Reputation Systems,” Comm. ACM, vol. 43, no. 12, pp. 45-48, 2000.
[27] A. Singh and L. Liu, “TrustMe: Anonymous Management of Trust Relationships in Decentralized P2P Systems,” Proc. IEEE Int'l Conf. Peer-to-Peer Computing, Sept. 2003.
[28] S. Song, K. Hwang, and Y.K. Kwok, “Risk-Resilient Heuristics and Genetic Algorithms for Security-Assured Grid Job Scheduling,” IEEE Trans. Computers, vol. 55, no. 8, Aug. 2006.
[29] M. Srivatsa, L. Xiong, and L. Liu, “Trustguard: Countering Vulnerabilities in Reputation Management for Decentralized Overlay Networks,” Proc. 14th Int'l World Wide Web Conf. (WWW '05), pp. 422-431, 2005.
[30] T. Stading, “Secure Communication in a Distributed System Using Identity-Based Encryption,” Proc. Third IEEE Int'l Symp. Cluster Computing and the Grid (CCGrid '03), May 2003.
[31] E. Sit and R. Morris, “Security Considerations for P2P Distributed Hash Tables,” Proc. First Int'l Workshop Peer-to-Peer Systems (IPTPS), 2002.
[32] S. Song, K. Hwang, R. Zhou, and Y.K. Kwok, “Trusted P2P Transactions with Fuzzy Reputation Aggregation,” IEEE Internet Computing, pp. 18-28, Nov./Dec. 2005.
[33] K. Walsh and E. Sirer, “Experience with an Object Reputation System for Peer-to-Peer File-Sharing,” Proc. Third Symp. Networked Systems Design and Implementation (NSDI '06), May 2006.
[34] A. Whitby, A. Josang, and J. Indulska, “Filtering Out Unfair Ratings in Bayesian Reputation Systems,” Proc. Workshop Trust in Agent Soc., July 2004.
[35] L. Xiong and L. Liu, “PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities,” IEEE Trans. Knowledge and Data Eng., vol. 16, no. 7, pp. 843-857, July 2004.
[36] L. Xiao, Y. Liu, and L.M. Ni, “Improving Unstructured Peer-to-Peer Systems by Adaptive Connection Establishment,” IEEE Trans. Computers, vol. 54, no. 9, pp. 1091-1103, Sept. 2005.
[37] B. Yang, T. Condie, S. Kamvar, and H. Garcia-Molina, “Non-Cooperation in Competitive P2P Networks,” Proc. 25th IEEE Int'l Conf. Distributed Computing Systems (ICDCS), 2005.
[38] M. Yang, Z. Zhang, X. Li, and Y. Dai, “An Empirical Study of Free-Riding Behavior in the Maze P2P File-Sharing System,” Proc. Fourth Int'l Workshop Peer-to-Peer Systems (IPTPS '05), Feb. 2005.
[39] H. Zhang, A. Goel, and R. Govindan, “Making Eigenvector-Based Reputation Systems Robust to Collusion,” Proc. Third Workshop Economic Issues in P2P Systems, June 2003.
[40] R. Zhou and K. Hwang, “PowerTrust: A Robust and Scalable Reputation System for Trusted P2P Computing,” IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 4, pp. 460-473, Apr. 2007.
[41] R. Zhou and K. Hwang, “Gossip-Based Reputation Aggregation in Unstructured P2P Networks,” Proc. 21st IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '07), Mar. 2007.
[42] R. Zhou, “Scalable Reputation Systems for Peer-to-Peer Networks,” PhD dissertation, Dept. of Computer Science, Univ. of Southern California, May 2007.
[43] H. Zhuge, X. Sun, J. Liu, E. Yao, and X. Chen, “A Scalable P2P Platform for the Knowledge Grid,” IEEE Trans. Knowledge and Data Eng., vol. 17, no. 12, pp. 1721-1736, Dec. 2005.
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool