CAJ | 학술논문

针对结构化对等网系统的拓扑失配问题,提出一种基于自组织聚类及自决定聚首的路由算法.该算法为每个节点设置不同的聚类邻居集,每个节点根据自己的能力决定是否成为自己邻居集的聚首.节点资源的查找按照自身邻居集查找、聚首邻居集查找及常规算法查找3步进行.实验结果表明,改进后算法具有较高的路由查找成功率,可较好地解决拓扑失配问题.
침대결구화대등망계통적탁복실배문제,제출일충기우자조직취류급자결정취수적로유산법.해산법위매개절점설치불동적취류린거집,매개절점근거자기적능력결정시부성위자기린거집적취수.절점자원적사조안조자신린거집사조、취수린거집사조급상규산법사조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.