计算机应用 ›› 2012, Vol. 32 ›› Issue (01): 143-146.DOI: 10.3724/SP.J.1087.2012.00143

• 网络与通信 • 上一篇    下一篇

基于leader-follower算法的超级节点研究

王小娟,周竹荣   

  1. 西南大学 计算机与信息科学学院,重庆 400715
  • 收稿日期:2011-06-28 修回日期:2011-08-22 发布日期:2012-02-06 出版日期:2012-01-01
  • 通讯作者: 王小娟
  • 作者简介:王小娟(1987-),女,陕西宝鸡人,硕士研究生,主要研究方向:语义网、面向服务计算;周竹荣(1970-),男,四川大竹人,副教授,博士,主要研究方向:语义网、面向服务计算。

Research of super-node based on leader-follower algorithm

WANG Xiao-juan,ZHOU Zhu-rong   

  1. College of Computer and Information Science, Southwest University, Chongqing 400715, China
  • Received:2011-06-28 Revised:2011-08-22 Online:2012-02-06 Published:2012-01-01
  • Contact: WANG Xiao-juan

摘要: 基于leader-follower算法的超级节点P2P网中,研究如何处理新进节点与各超级节点语义不匹配问题,有利于提高节点匹配效率和超级节点性能。引入通用类节点和分裂算法,将与各超级节点语义不匹配的新节点交由通用类节点管理,当管理的节点数目达到一定规模后,采用分裂算法将其分裂为若干语义相似簇,最后用合并排序算法从中选择最优节点作为超级节点。实验表明所提方法提高了节点匹配效率和超级节点性能,具有良好的可行性。

关键词: 超级节点P2P网, 超级节点, 语义, 分裂算法, 相似簇, 合并排序算法

Abstract: Analyzing how to deal with new-node that does not match the super-node in super-node P2P network based on leader-follower algorithm can help improve the efficiency and performance of super-node. The paper introduced general class node and splitting algorithm, and the nodes that do not match every super-node were managed by the general class node. When the nodes reached a certain number, the splitting algorithm was used to split these nodes into several semantic similarity clusters. Finally, the merge sorting algorithm chose the optimal node as super-node. The experimental results show that the proposed method improves the efficiency and performance of super-node, and it has good feasibility.

Key words: super-node Peer-to-Peer (P2P) network, super-node, semantic, splitting algorithm, similarity cluster, merger sorting alogorithm

中图分类号: