Abstract
In decentralized interaction-based reputation systems, nodes store information about the past interactions of other nodes. Based on this information, they compute reputations in order to take decisions about future interactions. Computing the reputations with the complete history of interactions is inefficient due to its resource requirements. Furthermore, the complete history of interactions accumulates old information, which may impede the nodes from capturing the dynamic behavior of the system when computing reputations. In this paper, we propose a scheme for reducing the amount of history maintained in decentralized interaction-based reputation systems based on elements such as the age of nodes, and we explore its effect on the computed reputations showing its effectiveness in both synthetic and real-world graphs.
Chapter PDF
References
Amaral, L.A.N., Scala, A., Barthélémy, M., Stanley, H.E.: Classes of small-world networks. Proc. Natl. Acad. Sci. U.S.A. (2000)
Bar-Yossef, Z., Mashiach, L.T.: Local approximation of pagerank and reverse pagerank. In: ACM SIGIR (2008)
Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science (1999)
Bonacich, P.: Eigenvector-like measures of centrality for asymmetric relations. Social Networks (2001)
Borgatti, S., Carley, K., Krackhardt, D.: On the robustness of centrality measures under conditions of imperfect data. Social Networks (2006)
Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. The MIT Press (1990)
Costenbader, E., Valente, T.: The stability of centrality measures when networks are sampled. Social Networks (2003)
De Alfaro, L., Kulshreshtha, A., Pye, I., Adler, B.T.: Reputation systems for open collaboration. Commun. ACM (2011)
Feldman, M., Lai, K., Stoica, I., Chuang, J.: Robust incentive techniques for peer-to-peer networks. In: ACM EC (2004)
Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry (1977)
Geisberger, R., Sanders, P., Schultes, D.: Better approximation of betweenness centrality. In: ALENEX (2008)
Gkorou, D., Pouwelse, J., Epema, D.: Betweenness centrality approximations for an internet deployed p2p reputation system. In: IEEE IPDPSW, HotP2P (2011)
Gyongyi, Z., Garcia-Molina, H., Pedersen, J.: Combating web spam with trustrank (2004)
Hajra, K., Sen, P.: Aging in citation networks. Physica A: Statistical Mechanics and its Applications (2005)
Kamvar, S.D., Schlosser, M.T., Garcia-Molina, H.: The eigentrust algorithm for reputation management in p2p networks. In: WWW (2003)
Marti, S., Garcia-molina, H.: Taxonomy of trust: Categorizing p2p reputation systems. Computer Networks (2006)
Meulpolder, M., Pouwelse, J., Epema, D., Sips, H.: Bartercast: A practical approach to prevent lazy freeriding in p2p networks. In: IEEE IPDPS, Hot-P2P (2009)
Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford InfoLab (1999)
Post, A., Shah, V., Mislove, A.: Bazaar: Strengthening user reputations in online marketplaces. In: NSDI (2011)
Pouwelse, J.A., Garbacki, P., Wang, J., Bakker, A., Yang, J., Iosup, A., Epema, D.H.J., Reinders, M., van Steen, M.R., Sips, H.J.: Tribler: a social-based peer-to-peer system. Concurr. Comput.: Pract. Exper. (2008)
Xiong, L., Liu, L.: Peertrust: Supporting reputation-based trust for peer-to-peer electronic communities. IEEE TKDE (2004)
Zeng, A., Cimini, G.: Removing spurious interactions in complex networks, arXiv:1110.5186v1 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Gkorou, D., Vinkó, T., Chiluka, N., Pouwelse, J., Epema, D. (2012). Reducing the History in Decentralized Interaction-Based Reputation Systems. In: Bestak, R., Kencl, L., Li, L.E., Widmer, J., Yin, H. (eds) NETWORKING 2012. NETWORKING 2012. Lecture Notes in Computer Science, vol 7290. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30054-7_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-30054-7_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30053-0
Online ISBN: 978-3-642-30054-7
eBook Packages: Computer ScienceComputer Science (R0)