A cache-based search algorithm in unstructured P2P networks

Peer-to-Peer (P2P) network is an important component to implement next generation Internet, how to quickly and efficiently search the resources in P2P networks has become one of the most critical issues, at the same time, this is one of greatest concern to users. This paper describes the basic Flooding Peer-to-Peer network search method, followed by analysis of several new search methods pros and cons, and then further analysis of these algorithms is proposed based on a cache-based search algorithm: When a node of the remaining load capacity is high, it will become the center node, and form a joint topology area with the nearby nodes together, then the center node and ordinary nodes also need to store the index cache, at the local region the overheating resources will be copied to the local (that is, the contents cache). The simulation shows that the algorithm can effectively improve the hit rates of resources searching, reduce the query delay.

[1]  Shi Lin,et al.  Load balancing algorithm based on network positioning in structured P2P systems , 2008 .

[2]  Dimitrios Tsoumakos,et al.  A Comparison of Peer-to-Peer Search Methods , 2003, WebDB.

[3]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[4]  Krishna P. Gummadi,et al.  An analysis of Internet content delivery systems , 2002, OPSR.

[5]  Yuhua Liu,et al.  The topology optimization of controlling Hubs in P2P networks , 2010, 2010 2nd International Conference on Future Computer and Communication.

[6]  Jong Hyuk Park,et al.  An effective simulation method for search strategy in unstructured P2P network , 2010, Simul. Model. Pract. Theory.

[7]  Krishna P. Gummadi,et al.  A measurement study of Napster and Gnutella as examples of peer-to-peer file sharing systems , 2002, CCRV.

[8]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[9]  Hector Garcia-Molina,et al.  Designing a super-peer network , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[10]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[11]  Jim Dowling,et al.  Using Aggregation for Adaptive Super-Peer Discovery on the Gradient Topology , 2006, SelfMan.

[12]  Fatos Xhafa,et al.  Local search methods for efficient router nodes placement in wireless mesh networks , 2012, J. Intell. Manuf..

[13]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[14]  Li-Ning Xing,et al.  An efficient search method for multi-objective flexible job shop scheduling problems , 2009, J. Intell. Manuf..

[15]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002 .

[16]  Paulo Ferreira,et al.  Distributed shared memory infrastructure for virtual enterprise in building and construction , 2001, J. Intell. Manuf..