A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is
In peer-to-peer (P2P) networks, reputation aggregation and peer ranking are the most time-consuming and spacedemanding operations. This paper proposes a gossip-based reputation system (GossipTrust) for fast aggregation of global reputation scores. It leverages a Bloom filter based scheme for efficient score ranking. GossipTrust does not require any secure hashing or fast lookup mechanism, thus is applicable to both unstructured and structured P2P networks. Randomized gossiping with effectivedoi:10.1109/tkde.2008.48 fatcat:rknbcgdl2jay5pacp5lx4gcxna