An Improved Peer-to-Peer Routing Algorithm K-CSSP Based on Communication History Clustered by K-means

This paper presented an improved routing algorithm K-CSSP of structured P2P overlay networks based on clustering the nodespsila communication history of the CSSP. This routing algorithm computing the nodespsila stability via storing the nodespsila communication history distributed. The K-CSSP uses the K-means algorithm to cluster the CSSP nodes by the stabilities into K regions which inter-linked each other by steady kernel node, and it can get O (N) routing path only use O (L+K) routing fingers. After a set of definition, a distributed cluster model, routing algorithms and cluster-center nodepsilas updating algorithm were presented to ensure the self-organization. Simulations and analysis prove the rightness and efficiency with fast cluster astringency, steady routing performance and topology.