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

摘要：

This paper presented an improved routing algorithm KCSSP of structured p2p overlay networks based on clustering the nodes’ communication history of the CSSP. This routing algorithm computing the nodes’ stability via storing the nodes’ 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 node’s 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.

关键词： K-CSSP CSSP Communication history K-means Cluster

作者: Zhenhua Tan Guiran Chang Wei Cheng Yi Ma

作者单位: Software College of Northeastern University, Shenyang City, Liaoning Province, China

会议类型: 国际会议

会议名称: 2009 Ninth International Conference on Hybrid Intelligent Systems(第九届混合智能系统国际会议 HIS 2009)

会议地点: 沈阳

会议语种:英文

页码: 1-5

在线出版日期: 2009-08-12（万方平台首次上网日期，不代表论文的发表时间）