期刊文献+

基于k-完美差异图的超节点拓扑结构构造

Super-peer topology construction based on k-perfect difference graph
下载PDF
导出
摘要 在超节点网络中,超节点拓扑结构及其动态维护和搜索路由机制,是影响网络性能和搜索效率的关键因素之一。在完美差异图(PDG)的基础上,提出了一种新的k-PDG结构,并利用该结构,建立了超节点网络——KPDGN,给出了KPDGN的动态维护和搜索路由机制。分析和模拟结果表明:KPDGN具有常数度数和固定邻接点特性,减少了查询所产生的带宽消耗,降低了拓扑构造和修复成本。 In the super-peer network,the super-peer topology structure and its mechanism of dynamic maintenance and search routing are important factors affecting network performance and search efficiency.In this paper,a new structure named k-Perfect Difference Graph(PDG) was proposed by analyzing the characteristics and the deficiencies of PDG,new Super-peer Network based on k-PDG(KPDGN) was constructed,and then the mechanism of dynamic maintenance and search routing was presented in KPDGN.The analysis and simulation results show that compared with current supper-peer topology,KPDGN has good performance with constant degree and fixed adjacent nodes,which reduces the bandwidth consumption during searching and the cost of topology construction and maintenance.
出处 《计算机应用》 CSCD 北大核心 2011年第8期2021-2024,2043,共5页 journal of Computer Applications
基金 国家自然科学基金资助项目(60973031 60973127)
关键词 超节点拓扑结构 完美差异图 动态拓扑维护 搜索路由机制 super-peer topology structure Perfect Difference Graph(PDG) dynamic topology maintenance search routing mechanism
  • 相关文献

参考文献14

  • 1Gnutella protocol RFC specification v0. 6 [ EB/OL]. [ 2011 - 01 - 10]. http://rfc-gnutella, sourceforge, net/src/rfc-0_6-dr-aft, html.
  • 2YU JIADI, LI MINGLU. CBT: A proximity-aware peer clustering system in large-scale BitTorrent-like peer-to-peer networks [ J]. Computer Communications, 2008, 31(3): 591-602.
  • 3GARBACKI P, DICK H J E, van STEEN M. The design and evalu- ation of a self-organizing superpeer network [ J]. IEEE Transactions on Computers, 2010, 59(3): 317-331.
  • 4LIN T-H, HO T-H, CHAN Y-W, et al. M-Ring: A distributed, self-organized, load-balanced communication method on super peer network [ C]//Proceedings of the International Symposium on Paral- lel Architectures, Algorithms, and Networks. Washington, DC: IEEE Computer Society, 2008:59 -64.
  • 5CHAWATHE Y, RATNASAMY S, BRESLAU L, et al. Making Gnutella-like P2P systems scalable [ C]// SIGCOMM 2003: Pro- ceedings of the 2003 Conference on Applications, Technologies, Ar- chitectures, and Protocols for Computer Communications. New York: ACM Press, 2003:25-29.
  • 6LI J-S, CHAO C-H. An efficient superpeer overlay construction and broadcasting scheme based on perfect difference graph [ J]. IEEE Transactions on Parallel and Distributed Systems, 2010, 21 (5): 594 - 606.
  • 7YU GE, YAN TING. Similarity-based semantics searching in super- peer network model [ C]//Proceedings of International Conference on Internet Technology and Applications. Washington, DC: IEEEComputer Society, 2010:1 -4.
  • 8DOULKERIDIS C, NORVAG K, VAZIRQIANNIS M. DESENT: Decentralized and distributed semantic overlay generation in P2P networks [ J]. IEEE Journal on Selected Areas in Communications, 2007, 25(1): 25-34.
  • 9QIAO BAIYOU, WANG GUOREN, XIE KEXIN. A taxonomy- based approach for constructing semantics-based super-peer networks [ C]// Proceedings of Asia-Pacific Web Conference and Web-Age Information Management. Berlin: Springer, 2007:122-134.
  • 10PYUN Y J, REEVES D S. Constructing a balanced, (log(N)/log log (N)) -diameter super-peer topology for scalable P2P systems [ C]//Pro- ceedings of the Fourth International Conference on Peer-to-Peer Compu- ting. Washington, DC: LEEE Computer Society, 2004: 210-218.

二级参考文献21

  • 1Kaashoek M.F., Karger R.. Koorde: A simple degree optimal distributed hash table. In: Proceedings of the 2nd International Workshop on P2P Systems(IPIPS'03), Berkeley, CA, 2003, 98~107
  • 2Gnutella. http://gnutella.wego.com/
  • 3Freenet. http://freenet.sourceforge.net
  • 4Clarke I.. A distributed decentralized information storage and retrieval system[M.S. dissertation]. University of Edinburgh, UK, 1999
  • 5Clarke I., Sandberg O., Wiley B., Hong T.W.. Freenet: A distributed anonymous information storage and retrieval system. In: Proceedings of the ICSI Workshop on Design Issues in Anonymity and Un-observability, Berkeley, CA, 2000, 46~66
  • 6Clip2.com. The Gnutella protocol specification v0.4. http://www9.limewire.com/developer/gnutella protocol 0.4.pdf, 2000
  • 7Lv Q., Shenker S.. Search and replication in unstructured peer-to-peer networks. In: Proceedings of ACM SIGGRAPH'02, San Antonio, TX, 2002, 84~95
  • 8Plaxton C., Rajaraman R., Richa A.. Accessing nearby copies of replicated objects in a distributed environment. In: Proceedings of ACM SPAA, Newport, RI, 1997, 311~320
  • 9Preparata F.P., Vuillemin J.. The cube-connected cycles: A versatile network for parallel computation. Communications of the ACM, 1981, 24(5): 300~309
  • 10Shen H.Y., Xu C.Z., Chen G.. Cycloid: A new constant-degree and lookup efficient P2P overlay network. In: Proceedings of International Parallel and Distributed Symposium(IPDPS'04), Santa Fe, 2004

共引文献15

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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