Date Added: Dec 2011
Search efficiency and accuracy of resource are important considerations for search algorithm in Peer-To-Peer (P2P) network. Most search algorithms use flooding among neighbor nodes to search relevant resource. However, this usually causes great amount of redundant messages, which results in high search costs and low search precision. In this paper, the authors use a new search strategy named TTL-Search, the key idea of searching process is divided into two stages, and each stage adopts different forwarding strategies. Analysis and experimental results show that, TTL-Search can overcome blindness of flooding search, and also can reduce redundancy overhead caused by query to some extend.