arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1204.5314cs.SIphysics.soc-ph
收藏

大规模分布式网络中一种可调的可信节点识别机制

A Tunable Mechanism for Identifying Trusted Nodes in Large Scale Distributed Networks

Joydeep Chandra, Ingo Scholtes, Niloy Ganguly, Frank Schweitzer

摘要:

在本文中,我们提出了一个简单的随机化协议,用于确定信任节点的个性化信任的基础上,在大规模分布式网络。在大型网络环境中,基于个性化信任来识别可信节点的问题源于远程节点详尽地计算和传播信任估计所涉及的巨大计算和消息开销。然而,在任何实际场景中,节点通常与节点的小子集通信,因此详尽地估计所有节点的信任可能导致巨大的资源消耗。相比之下,我们的机制可以调整到定位所需的子集的可信节点,基于允许的开销,相对于一个特定的用户。该机制是基于一个简单的交换随机游走消息和节点计数的次数,他们被击中的随机游走的节点在他们的邻居。仿真结果表明,该算法的有效性分析表明,使用该算法,节点识别顶部信任节点在网络中具有很高的概率,通过探索只有约45%的总节点,并反过来产生近90%的开销减少相比,一个详尽的信任估计机制,名为TrustWebRank。最后,我们提供了一个节点的全球可信度的措施;模拟结果表明,使用我们的机制生成的措施相比,TrustWebRank仅相差约0.6%。

英文摘要:

In this paper, we propose a simple randomized protocol for identifying trusted nodes based on personalized trust in large scale distributed networks. The problem of identifying trusted nodes, based on personalized trust, in a large network setting stems from the huge computation and message overhead involved in exhaustively calculating and propagating the trust estimates by the remote nodes. However, in any practical scenario, nodes generally communicate with a small subset of nodes and thus exhaustively estimating the trust of all the nodes can lead to huge resource consumption. In contrast, our mechanism can be tuned to locate a desired subset of trusted nodes, based on the allowable overhead, with respect to a particular user. The mechanism is based on a simple exchange of random walk messages and nodes counting the number of times they are being hit by random walkers of nodes in their neighborhood. Simulation results to analyze the effectiveness of the algorithm show that using the proposed algorithm, nodes identify the top trusted nodes in the network with a very high probability by exploring only around 45% of the total nodes, and in turn generates nearly 90% less overhead as compared to an exhaustive trust estimation mechanism, named TrustWebRank. Finally, we provide a measure of the global trustworthiness of a node; simulation results indicate that the measures generated using our mechanism differ by only around 0.6% as compared to TrustWebRank.

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

↑