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.