P2ST:A Weighted Search Tree-based P2P Searching Model
Xin Liu · 2007
Improving search performance is an important issue in Peer-to-Peer(P2P)network systems.Although many policies are brought forward to address the issue,the question still exists.A searching model based on weighted search tree is proposed to improve search performance of unstructured P2P networks.A logical weighted k-tree is set up according to historical hit ratio,peers that have high probability to hit the query rise to higher layer of the tree,so that peers that unstable and have few hot resources are usually on low layer of the tree.Methods are also employed to increase efficiency of search,such as Hot peers caching,remote peer connections,source peer index and result index,and so on.Performance studies based on analyses and simulations are carried out,the results show that the proposed model can avoid a large amount of unnecessary messages,the overhead to maintain the tree is minimal,and outperforms related works in terms of search efficiency and search latency.