Secure Routing Based On Redundancy Index For Structured P2P Network

Nowadays, Peer to Peer compute is hot problem of distribute operation system and computer network research. At the time, with development of computer network, the software application based P2P technology, such as BT, PPLive and so on become more and more popular. But, with the Reflect about advantages and application of P2P technology, the problem of P2P in the area of security gradually has been of concern.On the base of analysis and comparison of several popular P2P structured the algorithm, a new routing option in this paper was advanced, which can maintain the P2P networks efficiency in the network that have some malicious nodes in the network. It is significance of theoretical and practical for open P2P networks As follows was the main work and innovation:It's was carried out on that P2P technology on the rise and development, and compare the difference of network services between P2P model and C/S model. Do simple summary about type of the existing P2P network, and explore the future trend of development about P2P technology.Base on the analogy of characteristics of P2P routing algorithm, Compared some different of four kinds of structured P2P network algorithm. On this basis, Paper made a abstract algorithm model about structure P2P network.At last, Paper analogy network security about structured P2P. And one new solution that can tolerate certain percentage malicious nodes in P2P network was proposed. Experimental proofed that this solution do not reduce the network for efficiency in network with some malicious nodes.