SSABC:a super-peer selection algorithm based on capacity  

SSABC:一种基于能力的超级节点选择算法(英文)

作　　者：赵生慧[1,2] 钱宁[1] 吴国新[1] 陈桂林[2] 

机构地区：[1]东南大学计算机网络和信息集成教育部重点实验室,南京210096 [2]滁州学院计算机科学与技术系,滁州239012

出　　处：《Journal of Southeast University(English Edition)》2008年第4期444-449,共6页东南大学学报（英文版）

基　　金：The National High Technology Research and Development Program of China (863 Program) (No.2007AA01Z422);the NaturalFoundation of Anhui Provincial Education Department (No.2006KJ041B,KJ2007B073)

摘　　要：Combining the characteristics of peer-to-peer （P2P） and grid, a super-peer selection algorithm--SSABC is presented in the distributed network merging P2P and grid. The algorithm computes nodes capacities using their resource properties provided by a grid monitoring and discovery system, such as available bandwidth, free CPU and idle memory, as well as the number of current connections and online time. when a new node joins the network and the super-peers are all saturated, it should select a new super-peer from the new node or joined nodes with the highest capacity. By theoretical analyses and simulation experiments, it is shown that super-peers selected by capacity can achieve higher query success rates and shorten the average hop count when compared with super-peers selected randomly, and they can also balance the network load when all super-peers are saturated. When the number of total nodes changes, the conclusion is still valid, which explains that the algorithm SSABC is feasible and stable.结合P2P和网格的特点,提出了从P2P与网格混合的分布式网络中选择超级节点的算法SSABC.算法使用网格信息监控系统(MDS)获取节点资源的动态属性信息,如可用带宽、空闲CPU、可用内存、当前连接数及在线时间等,根据以上属性计算节点的能力.当有新节点加入且超级节点均饱和时,从新节点或已加入节点中选择能力最高的作为新的超级节点.通过理论分析和仿真实验表明,基于能力选择的超级节点与随机选择的超级节点相比,提高了资源的查询成功率,缩短了平均查询跳数,并能够在超级节点饱和时均衡网络负载.当网络中节点数发生变化时,以上结论依然成立,说明了算法的可行性和稳定性.

关 键 词：peer to peer （P2P） GRID SUPER-PEER capacity selection： random selection 

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