Abstract: Each node in P2P networks acts as a router; therefore, selecting appropriate note to store-and-forward packets in searching a certain file can improve the efficiency. The authors constructed a dynamic topology model based on trusting scheme, gave the approaches to assess node reliabilityrate and detected fault nodes with encrypted messages sending. The congestion of nodes caused by too many links of high-reliability-rate nodes could be avoided in terms of setting response threshold of CPU's response time. To improve the performance of the networks, the updating algorithm of nodes linking based on trusting idea was designed, and it was verified by emulation experiments.

Key words: trusting management, P2P network, routing

摘要： 在对等网络中每个节点都充当了路由的作用，在搜索某文件时，正确地选择转发节点，可提高搜索文件的效率。构建了基于信任的动态拓扑模型，给出了节点信任度评估的方法；提出了用加密发送消息的方法，确定故障节点；通过设定CPU的响应时间阈值，解决高可信节点因被链接过多而导致的节点拥塞，避免对高可信节点的完全依赖；设计了基于信任的节点链接更新算法，提高了网络性能。通过仿真实验验证了该方法的正确性。

关键词: 信任管理, 对等网络, 路由选择