Study And Comparison Of Constant-Degree P2P Overlay Network Models

P2P (Peer to Peer) is of important significance in terms of the research, P2P technology demonstrate a strong technological superiority in areas of network applications. Distributed hash table (DHT) will organize overlay network into a number of standard graphs in structured P2P system, the data is mapped to the corresponding node, so structured P2P system have efficient routing algorithms. However, some classic structured P2P systems must maintain O (logN) neighbors, the number of neighbors, which nodes maintain, denote maintenance costs of network topology, that is to say, with the size increasing of the network, the Routing Table of each node will increase, and lead to expensive increase. Therefore, the constant-degree P2P system is very important in research. Some constant-degree P2P systems, such as Koorde, Viceroy, and Cycloid have been proposed. With the expansion of Internet, network data sharing and transmission is developing in the P2P model, therefore, the performance of constant degree P2P systems is important to improve network quality, stability and security.This paper studies P2P network system performance in different circumstances, and compare the constant-degree P2P system Tangram with others.The experimental results show that Tangram and Cycloid have better lookup efficiency than Koorde in the small scale networks, such as the thousands of nodes, but in larger network, the query efficiency of Tangram is clearly better than the Cycloid and Koorde, and has better load balance, higher search efficiency. Koorde has the lowest maintenance costs.