P2p Search Technology Research

Firstly, the thesis has introduced the P2P concept, the P2P search technique development history, the P2P search technique research current situation. Secondly, The thesis has done detailed expounding to relevance knowledge, such as structure and algorithm that the thesis searches for to P2P Search engine. The thesis develops detailed analysis taking the tradition P2P searches algorithm as an example and it appraise their respective advantage and abuse and it point out that the current P2P's searching engine of algorithm exist very big abuse in reconnaissance algorithm. It be only demanding combining with P2P network partly environment but pattern average C/S tradition product-based modification and adjust. With regard to P2P network, itself characteristic is not big breakthrough sums develop.Subsequently, the thesis has introduced a little pertinent new technique at presently, the new agreement such as: Gnutella agreement and Dynamic Query agreement and Tapestry project, OceanStore project, Pastry project and Chord project. The thesis has introduced that P2P searches for algorithmic four kinds of topology structure: The centre-rization topology, the entire distributed must structure-rization a topology, the entire distributed structure-rization topology and the half distributed topology. The P2P frame has changed tradition search engine effect basis and platform to architectural tradition C/S impingement. The P2P technology and the P2P search engine for the advantage with whose equity, but aspect such as augmentability, robustness, loads balance. When introducing that DHT searches for an algorithm, compare the length having introduced the network chain circuit detailedly with degree of contradiction relation, adopt accurate semanteme of distributed scattered column function reconnaissance algorithm to seek the impact of characteristic and power rules characteristic over P2P reconnaissance algorithm as well as small the world model with the contradiction between DHT algorithm. These all are to study P2P searches for the algorithmic hot spot, are just to study two aspect starts with most fault route in improving the reliability searching for an algorithm and seeking the random picture, is with three key element of the algorithm affecting a reconnaissance: Network structure builds a heavy load, the pretreatment job draws request that treatment is a standard, come to explore to already some algorithmic reconnaissance improvements, build or the new reconnaissance model according to this one standard , seek the new reconnaissance algorithm. Introduce that at present popular P2P search for algorithm now and then, introduce that general flood algorithm, iteration general flood algorithm, elicitation method general flood algorithm, local place index algorithm, Random Walk algorithm, Gnutella2 algorithm, because of move Agent algorithm, Modified-BFS algorithm and so on, these algorithm be distributed brought forward by author give priority to searching for algorithm rationale.Finally,with natural advantage under P2P network, the thesis priority has analysed the P2P algorithm searching for what be brought about effect to P2P, Suggest that the preferential reconnaissance algorithm and elicitation method search for algorithm combine each other with extent, strengthen the node room interactive ability, be to resolve a effective scheme producing large amount of redundancy data bag at present in P2P search technique and owing to P2P frame characteristic, The thesis has searched for an environment here on the basis, specifically for small range P2P , has brought forward brand-new data synchronism model DBFS, On the basis, the thesis has brought forward brand-new data synchronism model DBFS here specifically for small range P2P searches for an environment, And have explained every important component being a model's turn respectively: And 2 springs in the BFS algorithm, the elicitation method search for algorithm the node information, the algorithmic train of thought of DBFS, emphasize main tactics, mathematics certificate and concrete design having set forth the DBFS algorithm coming true. The experiment bear fruit indicates Redundancy data bag characteristics such as few, being able to lighten network loads on certain degree, the DBFS model having adopt distributed extent to give priority to an algorithm has.