Search Mechanism Based On Peer-to-peer Network Resources And Related Algorithms

With the fast development of computer and network technology, the number of users on the Internet is increasing dramatically, the traditional Client/Server model faces with many problems and challenges, therefore, it promotes the rapid development of Peer-to-Peer network(P2P). The technology of P2P network proposes a whole new class design pattern of distributed network which solves the inherent disadvantages of C/S network, and provides a new direction for the development of network technology and efficient use of resources.How to locate resources quickly and accurately is one of the key issues in P2P networks, therefore, it has become an important subject and hotspot to establish efficient resource searching mechanism in current P2P networks. After an in-depth research on the resource searching mechanism in P2P networks, this paper focused on unstructured P2P networks'searching algorithms. For the problem that there are too many redundant messages and the search efficiency is too low in traditional algorithms, this paper mainly improved in those two aspects, which proposed two resource searching strategies to reduce the number of redundant query messages, lower the message redundancy rate and improve the success rate of resource searching.Firstly, the related content of P2P networks was analyzed. This paper introduced the background and research significance, the research status of domestic and abroad, the definition, the technical features and the applications of P2P networks, explained the network topology in detail, emphatically analyzed the typical resource searching mechanism of P2P networks.Secondly, proposed a resource searching strategy based on neighbor-neighbor node in unstructured P2P networks. This strategy introduced neighbor-neighbor node information, meanwhile comprehensively considered of neighbor nodes'activeness and resource hit number to select the path which meets the conditions to forward query messages, it can send messages to the areas which the target resource may exist, so it can reduce the number of redundant messages. Experimental results show that this algorithm can reduce the message redundancy rate and improve the resource searching success rate.Thirdly, emphatically studied Ant Colony Algorithm. It is a population-based heuristic algorithm to solve complicated combinatorial optimization problems. As a swarm intelligent technology, it has strong ability of global optimization and parallelism, it can get results quickly and have obvious advantages in the dynamic network optimization, so it is more suitable for resource searching in dynamic networks.Finally, proposed a resource searching strategy based on Ant Colony Algorithm in unstructured P2P networks. It uses Ant Colony Algorithm to achieve intelligent searching. This strategy directs the query routing effectively by using the positive feedback principle of ant pheromones and neighbor nodes'degrees, it also considers the information of neighbor-neighbor node, so it can reduce the number of redundant query messages to some extent. Experimental results show that this algorithm can achieve efficient resource location, reduce the number of messages, lower the message redundancy rate and improve the success rate of resource searching, it is an effective resource searching strategy in unstructured P2P networks.