Research on Direction Search Algorithm Based on LAN Agent in P2P Network

In view of the problem of slow search speed conduced by failure Topology and limited retransmission nodes quantity in MDBS search algorithm; we proposed the LAN Agent-Based Direction Search algorithm-ABDS algorithm. We expounded the basic thought and design principle of ABDS algorithm and carried on the theoretical analysis to such as aspects of its accuracy and parameter values. The analysis results show that ABDS algorithm greatly improves the search speed while doesn't reduce the network coverage.

[1]  Yuanda Cao,et al.  A Novel Efficient Search Algorithm in Unstructured P2P Networks , 2007, Second Workshop on Digital Media and its Application in Museum & Heritages (DMAMH 2007).

[2]  Seungae Kang,et al.  Restricted Path Flooding Scheme in Distributed P2P Overlay Networks , 2008, 2008 International Conference on Information Science and Security (ICISS 2008).

[3]  Francesco Buccafurri,et al.  Enabling Selective Flooding to Reduce P2P Traffic , 2007, OTM Conferences.

[4]  Zhiyi Fang,et al.  Research of Direction-Based Search Algorithm in P2P Network , 2008, 2008 4th International Conference on Wireless Communications, Networking and Mobile Computing.

[5]  Christos Gkantsidis,et al.  Random walks in peer-to-peer networks: Algorithms and evaluation , 2006, Perform. Evaluation.

[6]  Alhussein A. Abouzeid,et al.  Optimizing random walk search algorithms in P2P networks , 2007, Comput. Networks.

[7]  Alhussein A. Abouzeid,et al.  Modeling and analysis of random walk search algorithms in P2P networks , 2005 .