The Research On Resources Search Algorithm Of Unstructured Peer-to-peer Networks

Unstructured P2P internet source searching algorithms have been a hot topic inthe P2P network studies. Nowadays lots of people devoted themselves to it, but thereare still some aspects that have to be improved, such as response time, networkoverlay and efficiency. Present algorithm uses blind forwarding which results in lowefficiency in source searching. Although some people bring up evidences for messageforwarding, the reliability and efficiency have to be improved.Based on the studies at home and abroad, indexing table and source connectivityare introduced to the unstructured P2P algorithm, which focuses on upgrading theperformance and efficiency through the following the work:1. Analyzing the present algorithms in P2P internet source searching and therelevant studies at home and abroad;2. Based on the properties of P2P internet and present algorithm, putting theindex table algorithm to improve efficiency;3. Analyzing and quantizing sources to calculate the connectivity which bringsthe message forwarding model, thus reducing the internet overlay of unstructured P2Psource searching;4. Using OPNET to test the improved algorithm: through changing the nodes inthe internet, compare the algorithm mentioned in this paper with the present one onoverlay and efficiency, and the test result shows the first one is a better one.