节点文献

一种新的常数度数的超节点拓扑结构构造

Research on Constructing a New Constant Degree Super-peer Topology

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 谭义红陈治平赵碧海林亚平

【Author】 TAN Yi-hong1,2,CHEN Zhi-ping2,ZHAO Bi-hai2,LIN Ya-ping1 1(School of Computer and Communication,Hunan University,Changsha 410082,China) 2(Department of Information and Computing Science,Changsha University,Changsha 410003,China)

【机构】 湖南大学计算机与通信学院长沙大学信息与计算科学系

【摘要】 超节点网络采用两层结构组织超节点和普通节点,有利于提高网络性能和搜索效率.而超节点拓扑结构及其动态维护机制和搜索路由机制,对网络性能和搜索效率具有重要影响.针对已有超节点拓扑结构存在动态维护复杂或查询产生信息多的问题,提出一种新颖的k-Petersen拓扑结构,并利用该结构,建立一种超节点网络KPSPN,给出了KPSPN的路由和动态维护机制.它具有常数度数和固定邻接点特性,不但支持模糊查询,而且解决了结构化超节点拓扑对动态性支持差的问题.模拟结果表明:KPSPN减少了查询所带来的带宽消耗,具有更小的拓扑构造和失效修复成本.

【Abstract】 The super-peer networks adopt two-layer hierarchy unstructured,comprising an upper layer of super-peers and an underlying layer of ordinary peers,and are commonly used to improve the performance of network and the search efficiency.While the dynamic maintenance and search routing mechanism of network topology has an important influence on these two properties.Existing networks topology structure have some defects,such as complex maintenance and consuming an excessive amount of bandwidth.This paper proposes a novel k-Petersen graph by analyzing the characteristics and the deficiencies of Petersen Graph,raises a new super-peer network KPSPN based on k-Petersen Graph,and then presents the mechanism of dynamic maintenance and search routing.KPSPN has good performance with constant degree and fixed adjacent nodes,supports proximity search and solves the issues that structured super-peer topology can not support the dynamic environment well.Simulation show that compared with current supper-peer topology,KPSPN reduces the bandwidth consuming during searching,and keeps less topology construction and failure repair cost.

【基金】 国家自然科学基金项目(60973031)资助;湖南省科学技术厅科技计划项目(2011FJ3247)资助
  • 【文献出处】 小型微型计算机系统 ,Journal of Chinese Computer Systems , 编辑部邮箱 ,2012年06期
  • 【分类号】TP393.02
  • 【下载频次】42
节点文献中: 

本文链接的文献网络图示:

本文的引文网络