期刊文献+

结构化P2P覆盖网络的Cayley图构造方法研究 被引量:1

Research of Construction Method Using Cayley Graph in Structure Peer to Peer Overlay Network
下载PDF
导出
摘要 结构化P2P覆盖网络通常都基于某个静态的图结构,而这些静态图又常常是Cayley图或其超图,这些静态图的直径、度等特性可以直接影响到覆盖网络拓扑的路由表大小、路由长度等特性,因此静态图的选择显得非常重要。Cayley图是使用代数群论建立的一类图,它的最大好处是其对称性和点传递性,利用Cayley图的这类性质,可以分析结构化P2P覆盖网络拓扑结构的本质。就几种典型的结构化P2P覆盖网络的静态拓扑,分析了其Cayley图构造方法的本质。 Overlay network in peer to peer system is often based on some static graph,and the static graph is Cayley graph or its supper graph. The diameter and degree of the static graph impact on the size and length of routing table in overlay network,so it is important to select static graph as topologies of overlay network. Cayley graph is a family graphs which is built with algebra group theory, has symmetry and vertex transitive properties, and we can analyze the essence of overlay network in peer to peer based on these properties. We analyze the essence of static topology of overlay network to some typical structure P2P system.
出处 《计算机科学》 CSCD 北大核心 2009年第4期81-83,132,共4页 Computer Science
基金 国家自然科学基金(No.60763013) 广东省自然科学基金(05011896) 广东省科技计划项目(No.2006B15401002) 广东省计算机网络重点实验室开放研究基金(CCNL200705) 广东省软件与应用技术实验室开放研究基金(2006B80407001)资助
关键词 CAYLEY图 对等网络 覆盖网络 对称性 Cayley graph,Peer to peer,Overlay network,Symmetry
  • 相关文献

参考文献15

  • 1Chen G,Xu C,Shen H, et al. P2P overlay networks of constant degree [C]//Proc. of the Int'l Workshop on Grid and Cooperative Computing. 2003 : 285-192
  • 2Aberer K, Alima L O,Ghodsi A, et al. The essence of p2p:a reference architecture for overlay networks [C]//Fifth IEEE International Conference on Peer-to-Peer Computing. 2005:11-20
  • 3Qu C, Nejdl W, Kriesell M. Cayley DHTs - a group - theoretic framework for analyzing DHTs based on cayley graphs [C]// The Second International Symposium on Parallel and Distributed Processing and Applications. 2004189-105
  • 4Akers S B, Krishnamurthy B. A group-theoretic model for symmetric interconnection networks [J]. IEEE Trans. Comput, 1989,38 : 555-566
  • 5Leighton F T. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes [M]. Morgan Kaufmann, 1992
  • 6Parhami B. Introduction to Parallel Processing: Algorithm and Architectures [M]. Plenum, 1999
  • 7Stoica I, Morris R, Karger D, et al. Chord: A scalable peer-to- peer lookup service for internet applications [J ]. Computer Communication Review, 2001,31 : 149-160
  • 8Ratnasamy S, Francis P, Handley M, et al. A scalable content addressable network [J]. Computer Communication Review, 2001,31:161-172
  • 9Xu J,Kumar A, Yu X. On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks[J]. IEEE Journal on Selected Areas in Communications, 2004, 22: 151-163
  • 10Kumar A, Merugu S, Xu J, et al. Ulysses: A robust, low-diameter,low-latency peer-to-peer network [J]. European transaction on telecommunications, 2004,15 : 571-587

同被引文献12

  • 1Akyildiz I F,Wang X, Wang W. Wireless mesh networks: a survey[ J]. Computer Networks ,2005,47 (4) :445 -487.
  • 2Akers S B, Krishnamurthy B. A group-theoretic model for symmetric interconnection networks [ J ]. IEEE Transactions Computers, 1989,38 ( 3 ) :555 -566.
  • 3Yu Zhen, Yao Xuanxia, Wang Ying, et al. DPT : A topology construction method for P2P networks [ J ]. Journal of Si-chuan University : Engineering Science Edition, 2010, 42(4) :103 -110.
  • 4Yu Jaewook, Kim Dongsoo, Tang K Wendy. Dense and sym-metric graph formulation and generation for wireless informa-tion networks [ J ]. Information Processing Letters, 2006,97 (3) :115 -117.
  • 5Huang Chungming, Hsu Tzheng, Hsu Mingfa . Network-aware P2P file sharing over the wireless mobile networks [ J ]. IEEE Journal on Selected Areas in Communications, 2007, 25(3) :204-210.
  • 6Shin M, Arbaugh W A. Efficient peer-to-peer lookup in multi-hop wireless networks [ J ]. KSII Transactions on Inter-net and Information Systems ,2009,3( 1 ) :5 -24.
  • 7Gallucciom L, Morabito G, Palazzo S, et al. Georoy : Aloca- tion-aware enhancement to viceroy peer-to-peer algorithm [ J ]. Computer Networks,2007,51 (8) : 379 -398.
  • 8Canali C, Renda M E, Santi P, et al. Enabling efficient peer- to-peer resource sharing in. wireless mesh networks [ J ]. IEEE Transactions on Mobile Computing,2010,9 (3) :333 -347.
  • 9Liang Huomin ,Xiao Wenjun. A novel structured overlaynet- work with constant degree and small-world features [ J ]. Chi-nese Journal of Computer, 201 O, 33 ( 9 ) : 66 -72.
  • 10Stoica I, Morris R, Karger D R, et al. Chord: A scalable peer-to-peer lookup protocol for internet applications [ J ]. IEEE./ACM Transactions on Networking,2003,11 ( 1 ) : 17 -32.

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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