Research Of P2p Content Search Based On DHT

Currently, peer-to-peer network technology has become a hot topic in the computer field. A lot of data objects are available in peer-to-peer network. Because of the large scale of peer-to-peer network, the way to improving efficiency of content search in such distributed network is the key point of peer-to-peer technology studies.This paper focuses on contents search technology based on distributed hash table in structured P2P network. Among existing structured peer-to-peer network model based on distributed hash table, Chord attracts more attention for reasons as follows: the search algorithm is clear, the routing is efficient and the cost of network maintenance is low. In Chord system with N nodes, the length of search path is O(log2N). When the network has a small scale, the search efficiency is acceptable. However, with the size of the network increasing, it becomes insufficient ideal, and needs further improve.In order to solve the problem of low routing efficiency in Chord model, this paper puts forward the Frc-Chord model. The model mainly modifies the structure of routing table and the routing search algorithm. First of all, the distance between two adjacent pointers in routing table is further subdivided by adding three additional pointer entries, and an extra attribute is added to record the prior of attribute node. Taking into account the cost of network maintenance and routing search delay, the corresponding optimization is made to routing table. Then, in order to solve the problem of unnecessary request forward, the routing search algorithm in Chord is optimized. Finally, path cache mechanism is used in new improved model.Through theoretical analysis, the length of search path in improved Frc-Chord is O(log5N). Compared with the Chord model, search efficiency is significantly increased. In p2psim simulation experiment, experiments of Chord model and the improved Frc-Chord model are respectively made. The results show that both the average length of searching path and the average searching latency, Frc-Chord model is optimizer than Chord.