Skip to main content
Article thumbnail
Location of Repository

HonestPeer: An enhanced EigenTrust algorithm for reputation management in P2P systems

By Heba A. Kurdi

Abstract

The visible success of the Peer to Peer (P2P) paradigm is associated with many challenges in finding trustworthy peers as reliable communication partners. Reputation management systems are emerging in the face of these challenges. The EigenTrust reputation management system is among the most known and successful reputation systems. On the other hand, a main drawback of this system is its reliance on a set of pre-trusted peers which causes nodes to center around them. As a consequence, other peers are ranked low despite being honest, marginalizing their effect in the system. To tackle this problem, this paper proposed enhancing the EigenTrust algorithm by giving peers with high reputation values (honest peers) a role in calculating the global reputation of other peers. Rather than solely depending on the static group of pre-trusted peers, the proposed algorithm, HonestPeer, selects the most reputable nodes, honest peers, dynamically based on the quality of the provided files. This makes HonestPeer more robust to the increase in the number of files and nodes in the system. Through simulation, it has been shown that HonestPeer has successfully maintained higher success rate and lower percentage of inauthentic downloads when compared to the original algorithm

Topics: P2P, EigenTrust, Reputation management, Trust management, File sharing, Electronic computers. Computer science, QA75.5-76.95
Publisher: Elsevier
Year: 2015
DOI identifier: 10.1016/j.jksuci.2014.10.002
OAI identifier: oai:doaj.org/article:6877642be43f43448b2065450f3b0cce
Journal:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://doaj.org/toc/1319-1578 (external link)
  • http://www.sciencedirect.com/s... (external link)
  • https://doaj.org/article/68776... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.