GossipTrust for Fast Reputation Aggregation in Peer-to-Peer Networks
GossipTrust for Fast Reputation Aggregation in Peer-to-Peer Networks
复制标题
DOI：
10.1109/tkde.2008.48
复制
发表时间：
2008-09
影响因子：
8.9
通讯作者：
Runfang Zhou;K. Hwang;M. Cai
中科院分区：
文献类型：
--
作者：
Runfang Zhou;K. Hwang;M. Cai
在点对点（P2P）网络中，声誉聚合和排名是最耗时和占用空间最多的操作。本文提出了一种新的快速分数聚合的八卦协议。我们开发了一个布隆过滤器架构，以实现有效的分数排名。这些技术不需要任何安全散列或快速查找机制，因此适用于非结构化和结构化P2P网络。我们报告了一个模拟的八卦信任信誉系统的设计原则和性能结果。随机八卦有效地利用了功率节点，可以在O（log2 n）个时间步长（其中n为P2P网络大小）内轻量级聚集和快速传播全局分数。基于gossip的协议旨在容忍动态的对等加入和离开，以及避免可能的对等勾结。该方案具有相当低的八卦消息开销，即n个节点有O（n log2 n）条消息。对于10,000个节点的网络，Bloom过滤每个节点最多需要512 KB内存。我们用分布式P2P文件共享和参数扫描应用程序来评估GossipTrust的性能。仿真结果表明，该算法具有聚合时间短、内存需求低、排序精度高等优点。这些结果表明，在可信的P2P应用程序中使用GossipTrust系统有很大的优势。
In peer-to-peer (P2P) networks, reputation aggregation and ranking are the most time-consuming and space-demanding operations. This paper proposes a new gossip protocol for fast score aggregation. We developed a Bloom filter architecture for efficient score ranking. These techniques do not require any secure hashing or fast lookup mechanism, thus are applicable to both unstructured and structured P2P networks. We report the design principles and performance results of a simulated GossipTrust reputation system. Randomized gossiping with effective use of power nodes enables light-weight aggregation and fast dissemination of global scores in O(log2 n) time steps, where n is the P2P network size. The Gossip-based protocol is designed to tolerate dynamic peer joining and departure, as well as to avoid possible peer collusions. The scheme has a considerably low gossiping message overhead, i.e. O(n log2 n) messages for n nodes. Bloom filters demand at most 512 KB memory per node for a 10,000-node network. We evaluate the performance of GossipTrust with distributed P2P file-sharing and parameter-sweeping applications. The simulation results demonstrate that GossipTrust has small aggregation time, low memory demand, and high ranking accuracy. These results suggest promising advantages of using the GossipTrust system for trusted P2P applications.