A path tracking search algorithm based on the credibility of node service ability

Designing an efficient search algorithm is a key challenge in unstructured peer-to-peer networks in order to reduce redundant messages in the search process. Addressing the problem, in this paper, a path tracking search algorithm based on the credibility of node service ability(CNSA) is proposed. we utilize the credibility of node service ability as heuristic information to probabilistically guide the search. The credibility of node service ability is a new neighbor selection criterion which allows a peer to evaluate the credibility of its each neighbor based on the successful feedbacks from previous searches and the service capability of each neighbor node itself. Meanwhile, aiming to eliminate the repeat messages forwarding and reduce the number of redundant messages, the path tracking mechanism and the local messages caching mechanism are combined into CNSA. Our extensive simulation results show that CNSA can reduce the number of redundant messages, increase the query hit rate and adaptation to the dynamic characteristics of P2P networks.

[1]  Po-Chiang Lin,et al.  Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[2]  Ma Wen.  Bidirectional Random Walk Search Mechanism for Unstructured P2P Network , 2012 .

[3]  Xiaohua Hu,et al.  A path-traceable query routing mechanism for search in unstructured peer-to-peer networks , 2010, J. Netw. Comput. Appl..

[4]  Alejandro López-Ortiz,et al.  Search Algorithms for Unstructured Peer-to-Peer Networks , 2007, 32nd IEEE Conference on Local Computer Networks (LCN 2007).

[5]  Daniel Stutzbach,et al.  On the Long-term Evolution of the Two-Tier Gnutella Overlay , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[6]  Ming Zhong,et al.  The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks , 2008, IEEE Transactions on Computers.

[7]  Sushil K. Prasad,et al.  SPUN: A P2P Probabilistic Search Algorithm Based on Successful Paths in Unstructured Networks , 2011, 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum.

[8]  Dimitrios Tsoumakos,et al.  Adaptive probabilistic search for peer-to-peer networks , 2003, Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003).

[9]  Song Jiang,et al.  LightFlood: Minimizing Redundant Messages and Maximizing Scope of Peer-to-Peer Search , 2008, IEEE Transactions on Parallel and Distributed Systems.

[10]  Walter Willinger,et al.  Sampling Techniques for Large, Dynamic Graphs , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.