GGRA: a grouped gossip-based reputation aggregation algorithm




An important issue in P2P networks is the existence of malicious nodes that decreases the performance of such networks. Reputation system in which nodes are ranked based on their behavior, is one of the proposed solutions to detect and isolate malicious (low ranked) nodes. Gossip Trust is an interesting previously proposed algorithm for reputation aggregation in P2P networks based on the concept of gossip. Despite its important contribution, this algorithm has deficiencies especially with high number of nodes that leads to high execution time and low accuracy in the results. In this paper, a grouped Gossip based Reputation Aggregation (GGRA) algorithm is proposed. In GGRA, Gossip Trust is executed in each group between group members and between groups instead of executing in the whole network. Due to the reduction in the number of nodes and using strongly connected graph instead of a weakly one, gossip algorithm in GGRA is executed quickly. With grouping, not only reputation aggregation is expected to be more scalable, but also because of the decrement in the number of errors of the gossiped communication, the results get more accurate. The evaluation of the proposed algorithm and its comparison with Gossip Trust confirms the expected results.


[1] Xuemin Shen, Heather Yu, John Buford, and Mursalin Akon. Handbook of peer-to-peer networking, volume 1. Springer Heidelberg, 2010.

[2] Kannan Govindan and Prasant Mohapatra. Trust computations and trust dynamics in mobile adhoc networks: a survey. Communications Surveys and Tutorials, IEEE, 14(2):279-298, 2012.

[3] Runfang Zhou, Kai Hwang, and Min Cai. Gossip-trust for fast reputation aggregation in peer-to-peer networks. Knowledge and Data Engineering, IEEE Transactions on, 20(9):1282-1295, 2008.

[4] Yoram Bachrach, Ariel Parnes, Ariel D Procaccia, and Jeffrey S Rosenschein. Gossip-based aggregation of trust in decentralized reputation systems. Autonomous Agents and Multi-Agent Systems, 19(2):153-172, 2009.

[5] Ruchir Gupta and Yatindra Nath Singh. Trust estimation and aggregation in peer-to-peer network using differential gossip algorithm. CoRR, abs/1210.4301, 2012.

[6] Mark Jelasity, Alberto Montresor, and Ozalp Babaoglu. Gossip-based aggregation in large dynamic networks. ACM Transactions on Computer Systems (TOCS), 23(3):219-252, 2005.

[7] David Kempe, Alin Dobra, and Johannes Gehrke. Gossip-based computation of aggregate information. In Foundations of Computer Science, 2003. Proceedings. 44th Annual IEEE Symposium on, pages 482-491. IEEE.

[8] Masanori Yasutomi, Yo Mashimo, and Hiroshi Shigeno. Grat: Group reputation aggregation trust for unstructured peer-to-peer networks. In Distributed Computing Systems Workshops (ICD-CSW), 2010 IEEE 30th International Conference on, pages 126-133. IEEE.

[9] Eyuphan Bulut and Boleslaw K Szymanski. Constructing limited scale-free topologies over peer-to-peer networks. Parallel and Distributed Systems, IEEE Transactions on, 25(4):919-928, 2014.

[10] Matei Ripeanu, Adriana Iamnitchi, and Ian Foster. Mapping the gnutella network. IEEE Internet Computing, 6(1):50-57, 2002.

[11] Klaus Wehrle and Ralf Steinmetz. Peer-to-Peer systems and applications. Springer, 2005.

[12] Jian Yang, Yiping Zhong, and Shiyong Zhang. An efficient interest-group based search mechanism in unstructured peer-to-peer networks. In Computer Networks and Mobile Computing, 2003. ICCNMC 2003. 2003 International Conference on, pages 247-252. IEEE.

[13] Weiguo Wu, Wenhao Hu, Yongxiang Huang, and Depei Qian. Group-based Peer-to-Peer Network Routing and Searching Rules, pages 509-514. Springer, 2005.

[14] Abhilash Gummadi and Jong P Yoon. Modeling group trust for peer-to-peer access control. In Database and Expert Systems Applications, 2004. Proceedings. 15th International Workshop on, pages 971-978. IEEE.

[15] Wen Ji, Shoubao Yang, Dong Wei, and Weina Lu. Garm: A group anonymity reputation model in peer-to-peer system. In Grid and Cooperative Computing, 2007. GCC 2007. Sixth International Conference on, pages 481-488. IEEE.

[16] Yong Zhang, Hongliang Zheng, Yining Liu, Keqiu Li, and Wenyu Qu. A group trust model based on service similarity evaluation in p2p networks. International Journal of Intelligent Systems, 26(1):47-62, 2011.

[17] Mansooreh Ezhei and Behrouz Tork Ladani. Gtrust: A group based trust model. The ISC International Journal of Information Security, 5(2):155-169, 2014.

[18] Kevin Hoffman, David Zage, and Cristina NitaRotaru. A survey of attack and defense techniques for reputation systems. ACM Computing Surveys (CSUR), 42(1):1, 2009.

[19] Ferry Hendrikx, Kris Bubendorfer, and Ryan Chard. Reputation systems: A survey and taxonomy. Journal of Parallel and Distributed Computing, 75:184-197, 2015.

[20] M Srikanth and KB Madhuri. Secure and effective p2p reputation system using trust management and self-certified cryptographic exchanges, 2013.

[21] Kazuhiro Kojima. Grouped peer-to-peer networks and self-organization algorithm. In Systems, Man and Cybernetics, 2003. IEEE International Conference on, volume 3, pages 2970-2976. IEEE.

[22] Huirong Tian, Shihong Zou,WendongWang, and Shiduan Cheng. A group based reputation system for p2p networks. In Autonomic and trusted computing, pages 342-351. Springer, 2006.

[23] Ajay Ravichandran and Jongpil Yoon. Trust management with delegation in grouped peer-to-peer communities. In Proceedings of the eleventh ACM symposium on Access control models and technologies, pages 71-80. ACM, 2006.

[24] Sepandar D Kamvar, Mario T Schlosser, and Hector Garcia-Molina. The eigen trust algorithm for reputation management in p2p networks. In Proceedings of the 12th international conference on World Wide Web, pages 640-651. ACM, 2003.

[25] Asaki Matsumoto, Yo Mashimo, Masanori Yasutomi, and Hiroshi Shigeno. Ilgt: Group reputation aggregation method for unstructured peer-to-peer networks. In Parallel and Distributed Systems (ICPADS), 2010 IEEE 16th International Conference on, pages 197-204. IEEE.

[26] Runfang Zhou. Scalable Reputation Systems for Peer-to-peer Networks. PhD thesis, 2007.

[27] Santo Fortunato. Community detection in graphs. Physics Reports, 486(3):75-174, 2010.

[28] Reza Zafarani and Huan Liu. Social computing data repository at asu. School of Computing, Informatics and Decision Systems Engineering, Arizona State University, 2009.

[29] Mathieu Bastian, Sebastien Heymann, and Mathieu Jacomy. Gephi: an open source software for exploring and manipulating networks. In ICWSM.

[30] Minas Gjoka, Maciej Kurant, Carter T Butts, and Athina Markopoulou. Walking in facebook: A case study of unbiased sampling of osns. In INFOCOM, 2010 Proceedings IEEE, pages 1-9. IEEE.

[31] Vincent D Blondel, Jean-Loup Guillaume, Renaud Lambiotte, and Etienne Lefebvre. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, 2008(10):P10008, 2008.

[32] Flavio Chierichetti, Silvio Lattanzi, and Alessandro Panconesi. Rumor spreading in social networks. Automata, Languages and Programming, pages 375-386, 2009.