Flooding file search method covering whole web

Abstract

The invention relates to an overlay-network flooding file searching method. The method is as follows: by the transmission of query information to all random neighbors of each time in a first phase, the depth of a flooding tree is reduced and correspondingly the delay of query is reduced; moreover, the method effectively reduces the meaningless sharp increase of searching load in the query times. Additionally, with the parameter alpha, the algorithm leads the increase of load to be adjustable. And a second phase of the algorithm also aims to effectively transmit the query information and reduce the times of repeatedly accessing the node so as to help reduce the network flow. In addition, the algorithm optimization strategy is introduced against the problems emerging in the searching process of the first phase.

Description

technical field [0001] The invention relates to a computer overlay network topology construction technology, in particular to an overlay network flooding file search method. Background technique [0002] The unstructured P2P (Peer to Peer, peer-to-peer computing) network is actually applied in the file sharing P2P system. Since it has no fixed index storage structure, its network maintenance is small, so it can be widely used. Gnutella (a practical file sharing network based on P2P network) and KaZaA (another file sharing network) have been applied in practice. Their file location is done by the flooding method, which itself has serious scalability problems and generates a lot of network traffic. Some literature shows that in a Gnutella network with only 50,000 nodes, even if 95% of the node pairs are less than 7 coverage hops, the flooding algorithm still needs to generate 330TB / month of traffic. Although KaZaA uses technologies such as super nodes and TTL-constrained fl...

AI Technical Summary

Problems solved by technology

[0006] The present invention aims at the problems of high network traffic, excessive search load and poor scalability in the performance of the TTL constrained flooding method adopted in both Gnutella and KaZaA, and proposes an overlay network flooding file search method, combining It combines the advantages of both TTL-constrained flooding and limited flooding. Just like TTL-constrained flooding, the first stage reduces the depth of the flooding tree by forwarding the query information to all neighbors each time, which also reduces the query delay. ; In addition, like bounded flooding, it also reduces the sharp increase in load in consecutive query rounds

Images