期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

典型DHT拓扑结构的研究 被引量：1

Analysis on Typical DHT Topologies
下载PDF
导出
摘要 从代数角度研究了主要的DHT(分布式哈希表)拓扑结构,为方便、深入地理解DHT拓扑结构,运用群论和图论的方法重点对其拓扑结构的数学性质作了详细的分析,这些数学性质在改进现有拓扑结构或设计新的拓扑结构时有很大的应用价值. This paper studies some important DHT Topologies from an algebraic standpoint. To make a profound understanding of topologies, it analyzes their algebriaic properties through group and graph theory, which are valuable in improring current topology and designing topology.
作者 万仲保 王宝荣 蔡俊
机构地区 华东交通大学信息工程学院
出处 《华东交通大学学报》 2008年第1期57-60,共4页 Journal of East China Jiaotong University
关键词 CAYLEY图 分布式哈希表 拓扑结构 cayley graphs DHT topology
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献7

  • 1I. Stoica, R. Morris, D. Karger, et al. Chord : A scalable peer-to-peer lookup service for internet applications. Annual Conference of the ACM Special Interest Group on Data Communications [ C ]. San Diego, CA, USA : ACM Press, 2001. 149 - 160.
  • 2D. Malkhi, M. Naor, and D. Ratajczak, Viceroy : A scalable and dynamic emulation of the butterfly, in Proc.21st ACM Symposium on Principles of Distributed Computing[ C ]. Monterey, AC : ACM Press,2002.183 - 192.
  • 3P. Maymounkov and D. Mazieres, Kademlia: A peer-to-peer information system based on the xor metric, in Proceedings of International Peer- to- Peer Symposium [ C ]. Cambridge : Springer, 2002.53 - 65.
  • 4S. Ratnasamy, P. Francis, M. Handley, et al. A scalable content- addressable network. In Annual Conference of the ACM Special Interest Group on Data Communications[C]. San Diego, CA, USA : ACM Press,2001.161 - 172.
  • 5F. Kaashoek and D. Karger, Koorde: A simple degreeoptimal distributed hash table, in International Peer-to-Peer Symposium [ C ]. Berkeley, CA : Springer, 2003.98 - 107.
  • 6S. Akers and B. Krishnamurthy, A group- theoretic model for symmetric interconnection networks [ J ]. IEEE Transactions on Computers, 1989,38 (4) : 555 - 566.
  • 7P. Ganesan and G. S. Manku, Optimal routing in Chord, in ACM SIAM Symposium on Distributed Algorithms[ C]. New Orleans, Louisiana: Society for Industrial and Applieel Mathematics, 2004.176 - 185.

同被引文献5

  • 1蔡晟,王泽兵,冯雁,陈海燕.基于Super-peer的对等网络研究[J].计算机应用研究,2004,21(6):258-260. 被引量：24
  • 2F Kaashoek, D Karger. A simple degree-optimal dis- tributed hash table [ C ]//International Peer-to- Peer Symposium. Berlelev. CA: Springer. 2003: 95-107.
  • 3Donsheng Li, et al. Topology Construction and Resource Discovery in Peer-to-Peer Networks [ K ]. Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks. Germ: AuerbachPublications, 2005 : 1- 10.
  • 4J IANG H, JIN S D. Exploiting dynamic querying like flooding techniques in unstructurted peer-to-peer net- works [C ]//13th IEEE International Conference on Net- work Protocols (ICNP). New York: IEEE press, 2005 : 10.
  • 5ChristosGkantsidis, MilenaMihail, AminSaberi. Ran- dora walks in peer-to-peer networks [ C ]//Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies. New York: IEEE press, 2004 : 120- 130.

引证文献1

华东交通大学学报
2008年 第1期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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