首页 | 本学科首页   官方微博 | 高级检索  
     

基于自组织聚类及自决定聚首的路由算法
引用本文:李照奎,石祥滨,王 岩.基于自组织聚类及自决定聚首的路由算法[J].计算机工程,2010,36(7):93-95,9.
作者姓名:李照奎  石祥滨  王 岩
作者单位:(沈阳航空工业学院计算机学院,沈阳 110136)
摘    要:针对结构化对等网系统的拓扑失配问题,提出一种基于自组织聚类及自决定聚首的路由算法。该算法为每个节点设置不同的聚类邻居集,每个节点根据自己的能力决定是否成为自己邻居集的聚首。节点资源的查找按照自身邻居集查找、聚首邻居集查找及常规算法查找3步进行。实验结果表明,改进后算法具有较高的路由查找成功率,可较好地解决拓扑失配问题。

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

Routing Algorithm Based on Self-organizing Clustering and Self-determination Clustering Leader
LI Zhao-kui,SHI Xiang-bin,WANG Yan.Routing Algorithm Based on Self-organizing Clustering and Self-determination Clustering Leader[J].Computer Engineering,2010,36(7):93-95,9.
Authors:LI Zhao-kui  SHI Xiang-bin  WANG Yan
Affiliation:(School of Computer Science, Shenyang Institute of Aeronautical Engineering, Shenyang 110136)
Abstract: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.
Keywords:Peer-to-Peer(P2P) network  network routing algorithm  topology mismatch
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号