检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]长沙学院信息与计算科学系,长沙410003 [2]湖南大学计算机与通信学院,长沙410082
出 处:《计算机应用研究》2015年第2期569-573,588,共6页Application Research of Computers
基 金:国家自然科学基金资助项目(60973031);湖南省科技计划经费资助项目(2011FJ3247)
摘 要:超节点网络采用两层结构组织超节点和普通节点,有利于提高网络性能和搜索效率。而现有的超节点拓扑结构及其动态维护机制和搜索路由机制存在维护复杂或查询产生信息多的缺陷。针对这些问题,提出一种新颖的层次完美差异图HPDG(k)拓扑结构,建立了一种超节点网络HPDGN,给出了HPDGN的路由和动态维护机制。它具有常数度数和固定邻接点特性,不但支持模糊查询,而且解决了结构化超节点拓扑对动态性支持差的问题。与现有拓扑结构的模拟对比实验结果表明,HPDGN减少了查询所带来的带宽消耗,具有更小的拓扑构造和失效修复成本。The super-peer networks adopt two-layer structure to organize super-peers and ordinary peers to improve the performance of network and the search efficiency. However, the dynamic maintenance and search routing mechanism of current network topology will lead to complexity of dynamic maintenance and excessive information caused by the query. To solve these problems, this paper proposed a novel HPDG(k) graph. With this structure,it constructed a new super-peer network HPDGN based on HPDG(k) graph, and presented a mechanism of dynamic maintenance and search routing. This new topology had good performance with constant degree and fixed adjacent nodes, supported proximity search and solved the issues that structured super-peer topology could not support the dynamic environment well. Simulation show that compared with current supper-peer topology, HPDGN reduces the bandwidth consuming during searching, and keeps less topology construction and failure repair cost.
关 键 词:超节点网络 完美差异图 网络拓扑结构 动态维护 路由机制
分 类 号:TP393.02[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.121