基于自组织聚类及自决定聚首的路由算法  

Routing Algorithm Based on Self-organizing Clustering and Self-determination Clustering Leader

作　　者：李照奎[1] 石祥滨[1] 王岩[1] 

机构地区：[1]沈阳航空工业学院计算机学院,沈阳110136

出　　处：《计算机工程》2010年第7期93-95,98,共4页Computer Engineering

摘　　要：针对结构化对等网系统的拓扑失配问题,提出一种基于自组织聚类及自决定聚首的路由算法。该算法为每个节点设置不同的聚类邻居集,每个节点根据自己的能力决定是否成为自己邻居集的聚首。节点资源的查找按照自身邻居集查找、聚首邻居集查找及常规算法查找3步进行。实验结果表明,改进后算法具有较高的路由查找成功率,可较好地解决拓扑失配问题。Aiming at the topology mismatch problem in structured Peer-to-Peer（P2P） network system, a self-organizing clustering and self-determination clustering leader routing algorithm is presented. The algorithm selects a set of neighbors clustering for each node. Each node becomes the leader of own neighbors clustering according to its power. Nodes find resources in accordance with their neighbors clustering, the leading neighbors clustering and the chord algorithm. Experimental results show that the algorithm improves routing performance, gains high route success rate and solves the topology mismatch problem.

关 键 词：对等网络 路由算法 拓扑失配 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]