Research On A Small World Paradigm Based Clustering Peer To Peer Network

With the high speed development of the Internet and the appearance of Information highway, the need of network based application change variously and quickly. As the problems of traditional Client/Server access mode which is easy to be hostility attacked and could not respond millions of requirements which would make it paralysis will affect the development of Internet partially. People begin to find a new way to access the information resource. In the year 1999, the appearance of Napster makes Peer to Peer network(shortening as P2P) came back to the focus of computer network research.By the analysis of the main two models of P2P network, a new P2P net work model which makes nodes bunching associated with Small-world is proposed. This model absorbs the advantages of structured and unstructured P2P network and combines the characteristic of six degrees partition in Small- world model. The protocol message types and formats are defined ,and a mechanism which has solved the synchronization problem of the combination in vertex groups is presented and optimized. The way in file searching, which has changed the pattern of transferring between node and node from the pattern of transferring among vertex groups, enlarges the scope of searching and greatly reduce the hop count of the nodes while keeping the high hit ratio of file searching.In the verification of experiment, a network simulation tool called PeerSim has been used to complete the experiment of nodes bunching and file searching on different network scales. The statistics has shown that the hit ratio of file searching is about 97%. Meanwhile, compared to the protocol Chord which is proposed by MIT, this model has reduced two hop counts while having the same ratio of file searching.