基于k-Petersen图的超节点网络容错机制  

Efficient fault-tolerant mechanism in super-peer network based on k-Petersen graph

作　　者：谭义红[1,2] 赵碧海[1] 王鑫[1] 林亚平[2] 

机构地区：[1]长沙大学信息与计算科学系,长沙410003 [2]湖南大学计算机与通信学院,长沙410082

出　　处：《计算机应用研究》2011年第10期3900-3903,共4页Application Research of Computers

基　　金：国家自然科学基金资助项目(60973031);湖南省科技计划项目经费资助(2011FJ3247);湖南省教育厅科研资助项目(07B007)

摘　　要：针对已有容错机制动态维护复杂、带宽消耗大的问题,提出一种新的容错机制。首先,利用改进后的k-Petersen图,构建了超节点层拓扑结构,使网络具有高容错的特性;同时,给出超节点选择和超节点负载均衡方法,减少了超节点因负载过重而失效的情况;另外,给出超节点失效恢复算法和容错路由算法,解决了网络中失效超节点的恢复问题和网络路由问题。理论分析和实验结果显示,该网络具有易维护、高容错的特点。In order to solve the problem about dynamic maintenance complexly,large bandwidth consumption in existing fault-tolerant mechanism,proposed a novel efficient fault-tolerant mechanism.Firstly,based on improve the Petersen graph,proposed k-Petersen graph,and built the topology structure of super-peer layer with it.Meanwhile,proposed the method of super-peer selection and super-peers load-balance to reduce the possibility of super-peers failure caused by super-peer overloaded.Secondly,it used the resuming algorithm and the fault-tolerant routing algorithm to solve the fault-tolerant problem of super-peer network if super-peer was failed.The experimental results show that it is the high fault-tolerance of network and its dynamic maintenance is simple.

关 键 词：超节点网络 拓扑结构 容错性 彼特森图 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]