检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:杨磊[1] 李仁发[1] 胡益明[1] 李肯立[1]
机构地区:[1]湖南大学计算机与通信学院,湖南长沙410082
出 处:《通信学报》2010年第10期180-189,共10页Journal on Communications
基 金:国家自然科学基金资助项目(90715029)~~
摘 要:分析比较了目前无结构覆盖网络中的副本一致性维护算法,引入了节点能力度量参数——节点异构度,提出了一种基于节点异构度的无结构覆盖网络副本一致性维护方法——NHDCOM。NHDCOM利用Chord组管理协议管理副本节点,采用基于指取表的分割方法动态获取副本节点的异构信息;为优化副本的更新时间,利用动态规划方法提出了一种基于时延的节点度约束生成树算法。给出了NHDCOM的维护策略。理论分析和模拟实验结果表明,NHDCOM能高效地维护副本的强一致性。Replica strong consistency maintenance for unstructured overlay networks was studied.Current replica consistency maintenance algorithms was summarized,and a novel replica consistency maintenance algorithm:node heterogeneous degree-based of consistency maintenance algorithm(NHDCOM) was proposed.NHDCOM denoted the replica node capability by node heterogeneous degree(NHD).It managed replica nodes using Chord protocol and collected those nodes NHD along with a replica heterogeneous degree collection tree(HDCT) built through the finger table-based ring partition method.Moreover,a replica update problem model was abstracted in NHDCOM,and then a minimum delay update-content tree algorithm based on dynamic programming method was proposed to improve the update speed.Theoretical analysis and simulation results demonstrate that this method is more efficient in maintaining strong replica consistency and updating replica nodes for unstructured overlay network systems.
关 键 词:无结构覆盖网络 副本一致性维护 CHORD 异构度收集树 最小延迟更新内容树
分 类 号:TP393.4[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222