P2P网络最可信路径算法

针对分布式环境下P2P网络的特点,以及间接获取信息时的可信性,定义了间接获取信息时两个节点之间路径可信度的相关概念,提出了两个节点之间的最可信路径算法、最小可信路径算法,量化了最可信和最小可信路径的可信度,量化了两个节点之间传输消息时可信度的分布区间,分析了最可信和最小可信路径算法具有多项式的时间复杂度.通过典型应用,验证了最短路径并非最可信路径,最可信路径选择具有重要的使用价值.特别是在大规模分布式环境中,为人们从最可信路径获取信息提供了保障.

The most trusted path algorithm in P2P networks

Aiming at the characteristics of P2P networks in distributed environment and the trustworthiness of indirect obtaining information in network society,concepts associated with path trustworthiness between two nodes are defined and the most trusted path algorithm and the least trusted path algorithm are proposed.The trustworthiness of the most trusted path and the least trusted path are quantified.Analyses show that the time complexity of the algorithm is polynomial time.Both direction of message forwarding and direction of trustworthiness evaluation are cleary differentiated.Typical application verifies that the shortest path is not necessarily,the most trusted path and the most trusted path choosing effectively punishes low trustworthiness nodes.Especially in the large-scale distributed environment,it provides guarantee to obtain information from the most trusted path.