EigenTrust for Hierarchically Structured Chord

摘要

The paper proposes Hierarchical EigenTrust, an extension of EigenTrust, a trust and reputation algorithm that was proposed for flat peer-to-peer networks. The paper introduces the components of the hierarchical model architecture based on Chord, a scalable P2P (Peer-to-Peer) lookup service for Internet applications. The paper also extends the EigenTrust scheme to the hierarchically structured Chord P2P network. The proposed algorithm handles a huge number of nodes disseminated in different Chord rings, which improves complexity and reduces the number of malicious nodes. The experiments verify and compare the reduction of downloads from malicious peers, load distribution as well as convergence speed between a flat structured network and a hierarchically structured network. Results of the experiments show that hierarchical EigenTrust outperforms the flat EigenTrust in a P2P network that uses only one big ring.