关键词: 非结构化P2P网络, 拓扑结构, 节点兴趣, 完全二叉树

Abstract: For unstructured P2P network resource search algorithm’s inefficiency and excessive amount of redundant messages, combining with the characteristics of unstructured P2P network topology, this paper proposes a Complete Binary Tree Based on Interest （CBT-BI） unstructured P2P overlay network topology. It establishes a logical connection between the nodes of high similarity of interest, descending order in complete binary tree by their  similarity values of interest; in the process of resource search, it uses bidirectional resources search algorithm based on flooding algorithm. Simulation results show that the topological structure allows the nodes to find the resources in a short time, decreasing the query message, shortening the average routing path, improving the efficiency of resource search.

Key words: unstructured Peer to Peer（P2P） network, topology, interest of node, complete binary tree