| P2P t echnology d evelops r apidly in recent years, P2P file sharing has become one of mainstream applications in Internet. The core problem of P2P file sharing applications is effective file searching mechanism. There are many researches trying to solve these problems such as high bandwidth consumption, simple search model and bad search result from different angle. Because of P2P network's distributing characteristic and its scale enlarging with time, it is very difficult to test a new searching algorithm and collect its performance parameters in the real P2P network environment, so we primarily evaluate a new P2P algorithm and protocol through simulation. These are many simulators at present, but most of them are dedicated to some algorithms or some kinds of systems, there is no simulator that can support different algorithms and data.This thesis aims at making the following major contributions:Firstly, the thesis analyses the base characteristic of complex network, it includes the wildly existent base principles such as the zipf distribute, power-law and small world ,which can help to design the generic simulator and file searching algorithm.Secondly, the thesis presents a new distributing file searching method-FRFS. This algorithm based on friend relations, it establishes friend relations among the nodes according the searching interesting and sharing file relating, the search request firstly broadcast among the friendly nodes, few requests which don't receive response will continue to broadcast in the application lay based on DHT. The thesis adopts web log data and simulation data to fully test FRFS algorithm.Thirdly, the thesis design and implementation of a new generic peer-to-peer file searching simulator. This simulator has good expansibility, it can simulate m any kinds o f searching algorithms; it allows those algorithms to compare with each other under the same network condition, it can analysis the result of simulation from many angles, it can use simulate data and web log data. |
