Research On Resource Searching In An Unstructured P2P Network Based On Dynamic Greedy Strategy

Recently, The internet is becoming more and more important in people’s life, and it becomes an important source of resources. The explosive growth of network information, make the traditional server as the core of the network service model appears a lot of deficiencies. Peer to peer network (P2P) technology is widely used in the fields of resource sharing, collaborative work and real time communication with its unique characteristics, which has become a hot research topic in the Internet. In P2P network, each node is equal in status, which can be either the server or the client, and the data from the nodes no longer rely on the central server. In the unstructured P2P network, the nodes are constantly changing, how to efficiently and accurately locate resources is a difficult problem faced by P2P network resource sharing. Now the mainstream of the resource search algorithm is mainly based on flooding algorithm, random walk and improved algorithm based on the above algorithm, there are two problems of low search efficiency and a large number of redundant packets.In this paper, the problem of request redundancy and low search efficiency is analyzed when the flooding algorithm is used to search the network resources, and a new optimal search algorithm based on the greedy strategy is designed. First, establish the network model for non-structured P2P network, the model include 4 elements:the abstract initial node, in response to the nodes, the weights of the resources and the path cost, and the greedy algorithm based on introducing dynamic programming model, the selection problem in dynamic optimization strategy is applied to the resource search path, through model to solve the minimum path that resources search scheme. Through this algorithm, we can find the available resources more quickly and make the network’s normal communication. Simulation results show that compared with the traditional flooding algorithm, this algorithm can obtain the resource path through fewer search hops and improve the success rate of resource search.