Research And Improvement Of Chord Model In P2P Network

P2P technology, which is a hot topic in the computer network field, was praised for one of four new technologies altering the future of the whole Internet by Fortune Magazine and also was considered the future technology of wireless broadband Internet. Appearance of P2P technology brings to innovation for the whole network: it allows a computer to connect another computer directly and was applied to file sharing, so P2P technology alters traditional C/S model completely. The decentralized model making full use of network nodes resources efficiently implements resources sharing in the whole network.Since Napster as the first P2P business software was appeared, P2P technology, which has been paying more and more attention, has been reached structured P2P network which is third generation so far. Chord, Tapestry and CAN are typical representative. Structured P2P network, which offer load balance, well scalability and higher location efficiency, has a broad prospection. How to keep improving location efficiency and the structural integrity in a large scale network has been a hot and difficult point when structured P2P network goes into business application.In this thesis, the major works for Chord model are as follows: Firstly, P2P relative technologies are researched and analyzed on the basis of understanding P2P fundamental principle. Then, structed network typical representative, Chord model as an emphasis is deeply studied. Correlation theories and algorithms, especially lookup algorithm, nodes join and stabilization algorithm, are researched in this paper. Structure of routing finger table is the main factor of effecting lookup performance, so it is taken as breakthrough point. Based on analyzing the factors which effect performance, look performance is improved by improving the structure of finger table and representing RM-Chord model. To maintain integrity of structured network, an improved stabilization algorithm for Chord is represented and analyzed in terms of theory. Finally, through simulation experiments and theory analysis to average query path length and look latency, the improved methods are verified.