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

基于二维P2P的多环资源发现协议族

Multi-Ring Lookup Protocol Family Based on Bi-Dimensional P2P
下载PDF
导出
摘要 Chord中的所有节点可视作分布在一维空间中,形成单一的环。针对移动Ad hoc网络,该文提出二维P2P的概念,将所有节点视作分布在二维平面内,允许多个可灵活配置的环存在,并提供冗余查询路径。基于此概念,该文还提出多环二维P2P资源发现协议族,并给出协议族中可行的环配置方案,证明其在网络直径和度性能上的改善。仿真结果表明,合理的配置环能明显改善基于移动Ad hoc网络的P2P查询性能。 All nodes in Chord can be viewed as being placed into a one-dimensional ring. In this paper, a novel concept of bi-dimensional P2P is introduced for mobile Ad hoc networks, in which nodes are placed into a square, so that more than one configurable ring can be created, and redundant lookup routes can be provided. Based on the concept, the multi-ring bi-dimensional P2P lookup protocol family is .proposed. Applicable ring-configuration examples are provided and the performances are analyzed. Simulation results prove the performance improvement of the protocol family compared with Chord like protocols.
作者 司鹏搏 纪红 乐光新
机构地区 北京邮电大学泛网无线通信教育部重点实验室
出处 《电子与信息学报》 EI CSCD 北大核心 2009年第3期702-706,共5页 Journal of Electronics & Information Technology
基金 国家863计划项目(2007AA01Z221) 国家自然科学基金(60672124)资助课题
关键词 移动AD HOC网络 P2P 资源发现协议 CHORD环 二维P2P Mobile Ad hoc network Peer-to-Peer network Lookup protocol Chord ring Bi-dimensional P2P
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献12

  • 1Stoic I, Morris R, and Karger D, et al.. Chord: A scalable Peer-to-Peer lookup protocol for internet applications [J]. IEEE Trans. on Networking, 2003, 11(1): 17-32.
  • 2Rowstron A and Druschel P. Pastry: Scalable, distributed object location and routing for large-scale Peer-to-Peer systems [C]. IFIP/ACM International Conference on Distributed Systems Platforms Proceedings, Heidelberg, Germany, Nov., 2001: 329-350.
  • 3Zhao B Y, Kubiatowicz J D, and Joseph A D. Tapestry: An infra-structure for fault-resilient wide-area location and routing. Computer Science Division, University of California, Berkeley, Technical Report UCBI/CSD-01-1141, Apr., 2001.
  • 4Ripeanu M, Foster I, and Ianmitchi A. Mapping the Gnutella network: properties of large-scale Peer-to-Peer systems and implications for system design [J]. IEEE Internet Computing, 2002, 6(1): 50-57.
  • 5Xu J. On the fundamental tradeoffs between routing table size and network diameter in Peer-To-Peer networks [C]. IEEE INFOCOM 2003 Proceedings, San Francisco, CA, USA, 2003: 2177-2187.
  • 6Cordasco G, Gargano L, and Hammar M, et al.. F-Chord: Improved uniform routing on Chord. Lecture Notes in Computer Science. Heidelberg, Germany: Spinger Berlin, 2004: 89-98.
  • 7Naor M and Wieder U. Know thy neighbor's neighbor: Better routing for skip-graphs and small worlds [C]. 3rd International Workshop on Peer-to-Peer Systems Proceedings, La Jolla, CA, USA, 2004: 269-277.
  • 8Ren X and Gu Z. SA-Chord: A novel P2P system based on self-adaptive joining [C]. 6th IEEE International Conference on Grid and Cooperative Computing Proceedings, Urumchi, Xinjiang, China, 2007: 75-81.
  • 9Flocchini P, Nayak A, and Xie M. Enhancing Peer-to-Peer systems [J]. IEEE Journal on Selected Areas in Communications, 2007, 25(1): 15-24.
  • 10Yu S, Yu J, and Kamil K, et al. DR-Chord-FAn efficient double-ring Chord protocol [C]. 6th IEEE International Conference on Grid and Cooperative Computing Proceedings, Urumchi, Xinjiang, China, 2007: 16-18.
电子与信息学报
2009年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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