期刊文献+

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

Research on Constructing a New Constant Degree Super-peer Topology
下载PDF
导出
摘要 超节点网络采用两层结构组织超节点和普通节点,有利于提高网络性能和搜索效率.而超节点拓扑结构及其动态维护机制和搜索路由机制,对网络性能和搜索效率具有重要影响.针对已有超节点拓扑结构存在动态维护复杂或查询产生信息多的问题,提出一种新颖的k-Petersen拓扑结构,并利用该结构,建立一种超节点网络KPSPN,给出了KPSPN的路由和动态维护机制.它具有常数度数和固定邻接点特性,不但支持模糊查询,而且解决了结构化超节点拓扑对动态性支持差的问题.模拟结果表明:KPSPN减少了查询所带来的带宽消耗,具有更小的拓扑构造和失效修复成本. 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.
出处 《小型微型计算机系统》 CSCD 北大核心 2012年第6期1233-1237,共5页 Journal of Chinese Computer Systems
基金 国家自然科学基金项目(60973031)资助 湖南省科学技术厅科技计划项目(2011FJ3247)资助
关键词 超节点网络 彼特森图 网络拓扑结构 动态维护 路由机制 super-peer network petersen graph network topology structure topology dynamic maintenance search routing mechanism
  • 相关文献

参考文献2

二级参考文献14

  • 1SATTY T L. The Analytic Hierarchy Process [ M ]. New York: McGrawHill, 1980.
  • 2Milojicic Dejan S.et al.Peer-to-Peer Computing.Hewlett-Packard Company,2002
  • 3Tsoumakos D.et al.A comparison of Peer-to-Peer search methods.In:Proceedings of the WebDB,San Diego,CA,USA,2002,61~66
  • 4Ratnasamy S,Francis P,Handley M,Karp R..A scalable content-addressable network.In:Proceedings of the SIGCOMM 2001,San Diego,CA,USA,2001,161~172
  • 5Stoica I,Morris R,Karger D,Kaashoek M,Balakrishnan H..Chord:A scalable Peer-to-Peer lookup service for internet applications.In:Proceedings of the SIGCOMM 2001,San Deigo,CA,USA,2001,149~160
  • 6Castro M,Druschel P,Hu Y,Rowstron A..Exploiting network proximity in distributed hash tables.In:Proceedings of the FuDiCo 2002,Bertinoro,Italy,2002,52~55
  • 7Zhao B,Kubiatowicz J,Joseph A..Tapestry:An infrastructure for fault-tolerant wide-area location and routing.UCBerkeley:Technical Report UCB/CSD-0101141,2001
  • 8Schollmeier Rudiger.Why P2P (Peer-to-Peer) does scale:Analysis of P2P traffic patterns.In:Proceeding of the IEEE P2P Computing Conference,Link(o)ping,Sweden,2002,112~ 119
  • 9Saroiu S,Gummadi P.K,Gribble S.D..A measurement study of Peer-to-Peer file sharing systems.In:Proceedings of the Multimedia Computing and Networking Conference,San Jose,California,USA,2002
  • 10Sen Shubho,Wang Jia.Analyzing P2P traffic across large networks.In:Proceedings of the ACM SIGCOMM Internet Measurement Workshop (IMW),Marseilles,France,2002

共引文献43

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部