基于兴趣域的对等网络动态搜索机制*

针对非结构化P2P搜索机制不够灵活、不能有效解决跨域文件搜索的问题，提出一种基于兴趣域的非结构化P2P动态搜索算法。此算法根据每个节点共享的文件类型的差异，将网络进行分域，在分域的基础上利用预算值和TTL(time to live)值来控制搜索节点的数目和搜索的深度，对不同类型的搜索采用不同的搜索策略。实验表明，该搜索算法的节点覆盖率在50%左右，搜索效率保持在35%左右，即算法能够有效地满足用户的查询需求，效率比较稳定且高于当前典型的搜索算法。

Interest-based search scheme for unstructured P2P network

Because of the inflexibility, the search mechanism of unstructured P2P network cannot search cross-domain files efficiently. For this problem, this paper proposed an efficient search algorithm that based on interest-domain. The algorithm divided the network into different domains according to the different classification of files that each node shares. Used budget value and TTL (time to live) value to control the number of searched nodes and the search depth. Posed different search schemes for different search types. Experiment results show that with 50 percent nodes are covered, and the search efficiency is kept about 35 percent. In other words, the algorithm meets the inquiry needs of most users. The efficiency is relatively stable and higher than the typical search mechanism.