Feedback-based hybrid search algorithm in unstructured peer-to-peer networks

In order to improve search efficiency and reduce redundant messages efficiently in P2P networks,this paper proposed a feedback-based hybrid search algorithm.It forwarded the query messages to a subset of neighbors at some high-degree nodes and to only ones at other nodes,and utilized the feedback from the previous searches to guide current ones in the sear￣ching process to select those neighbors that can return the most and nearest results to query.The algorithm analysis and experimental results show that this algorithm not only achieves higher success rate,query hits and search efficiency,but also reduces redundant messages efficiently.Furthermore,it has a better self-adaptive ability to rapidly adapt the dynamical changing network behaviors.