arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1210.4301cs.NIcs.SI
收藏

基于差分Gossip算法的P2P网络信誉聚合

Reputation Aggregation in Peer-to-Peer Network Using Differential Gossip Algorithm

Ruchir Gupta, Y. N. Singh

摘要:

对等网络中的信誉聚合通常是一个非常耗时和资源消耗的过程。此外,大多数方法认为,一个节点将具有相同的声誉与网络中的所有节点,这是不正确的。本文提出了一种信誉聚合算法,使用一个变种的八卦算法称为差分八卦。本文认为信誉的估计有两个部分,一个是每个节点都相同的公共分量,另一个是基于邻居与节点的直接交互而从近邻接收到的信息。差分流言是快速的,并且需要更少的资源。该机制允许节点为每个节点计算网络中的每个其他节点的独立信誉值。研究了偏好连接\emph{(PA)}模型下幂律网络的差分流言信任.使用差分流言信任计算的声誉显示出良好的免疫量的共谋。我们在100到50,000个节点的不同规模幂律网络上验证了算法的性能。

英文摘要:

Reputation aggregation in peer to peer networks is generally a very time and resource consuming process. Moreover, most of the methods consider that a node will have same reputation with all the nodes in the network, which is not true. This paper proposes a reputation aggregation algorithm that uses a variant of gossip algorithm called differential gossip. In this paper, estimate of reputation is considered to be having two parts, one common component which is same with every node, and the other one is information received from immediate neighbours based on the neighbours' direct interaction with the node. The differential gossip is fast and requires less amount of resources. This mechanism allows computation of independent reputation value by a node, of every other node in the network, for each node. The differential gossip trust has been investigated for a power law network formed using preferential attachment \emph{(PA)} Model. The reputation computed using differential gossip trust shows good amount of immunity to the collusion. We have verified the performance of the algorithm on the power law networks of different sizes ranging from 100 nodes to 50,000 nodes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑