A P2P Network Topology Optimized Algorithm Based on Minimum Maximum K-Means Principle

The most popular routing algorithm in p2p network is that every node keeps a route table which records a certain number of other nodes. Such algorithm selects neighbor nodes at random, and this reduces routing efficiency. In this paper a new algorithm of optimizing p2p overlay network topology is proposed, which is based on minimum maximum k-means principle. According to the communication history, the division presents a steady network topology with k clusters and k cluster center nodes. This optimized p2p network topology presents a high performance of routing efficiency. The minimum maximum principle makes the division more appropriate, so that there will be less probability of being unsteady for the p2p network. The conclusions show that this algorithm is an efficient p2p network topology optimized algorithm.