A Research And Implement Of P2P Layered Network Model And Ant Colony Optimization

With the development of network technology.P2P quickly becomes the focus.It has broken the traditional C/S mode,the network node both act as client and the server's dual function.thus avoiding the C/S model the bottleneck caused by centralized services.network file-sharing rate has been greatly increased.Since randomly generated topology,the flooding search algorithms,so the performance in terms of its expansion is not satisfactory.Therefore,the people on the P2P's research focuses on two aspects:First,build scalability and stability of the network topology; the second is to develop more efficient and less costly query algorithm.Although the topology and search algorithms seemingly independent,but a well-organized topology algorithm for query performance improvement is obvious.This paper studies these issues in depth,presents a P2P-based resource credibility level domain model of ant search algorithm.Level domain model credibility to the node resources to conduct field organization,so make nodes with little difference node-credibility in the same area.Accordingly adopt a two-node resource query search strategy,the first layer of nodes are limited resources in the region query,not when the query within the resources,the ant colony algorithm using the second level domain-oriented resources reasonably among query,the search ant resource guide to the existence of query nodes in the domain of high credibility. Moreover,according to local principles of resource queries and power-law behavior, the paper also introduces a mechanism for resource initiatives to further improve the query statement of the efficiency,while reducing signaling traffic in the network query bandwidth resources occupation.In this paper,proposed search algorithm for P2P network model and feasibility and validity of the simulation experiment.Simulation results show that the classical K-Random Web Search algorithm comparison,due to extensive using within the query and the ant colony algorithm based on a reasonable inter-domain search-oriented search algorithm proposed in this paper has high search efficiency,hit rate,and low consumption of bandwidth resources.