A Self-Organizing Network Routing Model Based On P2P

P2P (Peer-to-Peer) networking is a new network model that has been sweeping through the computing industry over the past year or so. Supported by distributed computing technology, P2P may be one of the most important technology that influences the Internet in the future. Compared with the traditional Client/Server model, P2P has many advantages, such as the higher utilization of network resources, the elimination of bottleneck caused by central servers. The servent has the client and server function, can carry on data communication directly between each node, share the resource of the computer and service, does not need to rely on the centralized type server to support, and eliminate island of information and resource. So P2P has great potential value on commerce and technology.The paper sets up a full decentralized and self-organizing network routing model based on P2P network (cluster self-organizing network routing model, CSON), after considerations of the routing protocol of structured overlay network and Internet physical topology as well as the application of the next generation network which is of larger scale, decentralized, dynamic and self-organizing. The main issues and contributions of this paper are as following:The paper presents a system structure of self-organizing network routing model based on P2P network aimed to design system structure for building self-organizing network terrace of high performance, high utilization, load balance and dynamic, based on CSON in the wide area network. The terrace locates the applied layer, building a virtual network topology named P2P overlay network on top of Internet's physical topology layer, based on application the terrace which leads to the effective building of a full-decentralized internet and self-organizing network routing model.A new informational table of nodes and a new routing algorithm are designed , according to the cluster structure (Network cluster partitionment based on Internet topology). The algorithm avoids the problem of detouring. Lowered the system expense of routing, reducing the number of re-transmission message.The node can adapt dynamic state of network environment of P2P by self-adapting algorithm. Redundancy mechanism upgrade the reliability and usability of the system. By backuping other cluster's data items, thus raise the searching efficiency.