Reducing the History in Decentralized Interaction-Based Reputation Systems

• Published in: NETWORKING 2012 pp. 238 - 251
• Main Authors: Gkorou, Dimitra, Vinkó, Tamás, Chiluka, Nitin, Pouwelse, Johan, Epema, Dick
• Format: Book Chapter
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2012
• Series: Lecture Notes in Computer Science
• Subjects: computational cost; decentralized reputation systems; P2P networks
• ISBN: 3642300537; 9783642300530
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-642-30054-7_19

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.