Abstract: The value of recommendation trust is collected by flooding in traditional local trust mode1, but the method has low efficiency and takes up a lot of network resources. This paper presents a trust path search algorithm based on random walk, which is able to improve the search by using the path information in the past. The algorithm is efficient and valuable in network environment which is sensitive to resources occupying because it reduces the number of unnecessary messages and trust circuits effectively.

Key words: random walk, trust management model, trust path search

摘要： 传统的局部信任模型采用简单洪泛的方法获得信任信息，针对该方法效率较低且对网络资源消耗较大的问题，提出一种基于随机漫步的搜索信任路径的算法。通过以往遗留的路径信息改进搜索，可有效减少多余信息的数目和信任回路的出现。该算法适用于对网络资源占用比较敏感的环境。

关键词: 随机漫步, 信任管理模型, 信任路径搜索

CLC Number: 

• TP309.2