Study On Optimized Gnutella Route Searching Algorithm

With the rapid development of network,the amout of data became larger.It's more and more important to choose a good method for data query and exchange.P2P technical is just appear to meet this demand.P2P technical has a good future in the area of search engine,cooperation and data exchange.Gnutella is a protocol of unstructured p2p system.The flood query method of gnutella lead to a bad query result which restrict the development of p2p network.how to manage the network,how to execure a search method with a high efficiency and how to solve the extention problem is important to the development of network.The problem of the Gnutella flood protocol is that,it will cause redundant messages.the redundant message will lead to the over burden of the network.the optimized algorithm before reduced the burden of the network,but the query hit rate is not improved.this paper will introduce a new optimized algorithm based on index.First,this paper will introduce the history of p2p network and its development.we will pay more attention to the shortage of RWRI algorithm of Gnutella protocol.Second, this paper put forward a improved algorithm of gnutella: record the minimum distance between the node and the query target node to guard the query message; use both route index table and return path table to record the return path of the query hit message to guard the same query, the improvement above will optimized the query hit rate and the query result.Last, this paper compared the optimized algorithm and the old algorithm on ns2 and cygwin platform.the result indicate that under the optimized algorithm ,the query hit rate and the objective of query are improved.