高级搜索

留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
邮箱
手机号码
标题
留言内容
验证码

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

司鹏搏 纪红 乐光新

司鹏搏, 纪红, 乐光新. 基于二维P2P的多环资源发现协议族[J]. 电子与信息学报, 2009, 31(3): 702-706. doi: 10.3724/SP.J.1146.2007.01740
引用本文: 司鹏搏, 纪红, 乐光新. 基于二维P2P的多环资源发现协议族[J]. 电子与信息学报, 2009, 31(3): 702-706. doi: 10.3724/SP.J.1146.2007.01740
Si Peng-bo, Ji Hong, Yue Guang-xin. Multi-Ring Lookup Protocol Family Based on Bi-Dimensional P2P[J]. Journal of Electronics & Information Technology, 2009, 31(3): 702-706. doi: 10.3724/SP.J.1146.2007.01740
Citation: Si Peng-bo, Ji Hong, Yue Guang-xin. Multi-Ring Lookup Protocol Family Based on Bi-Dimensional P2P[J]. Journal of Electronics & Information Technology, 2009, 31(3): 702-706. doi: 10.3724/SP.J.1146.2007.01740

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

doi: 10.3724/SP.J.1146.2007.01740
基金项目: 

国家863计划项目(2007AA01Z221)和国家自然科学基金(60672124)资助课题

Multi-Ring Lookup Protocol Family Based on Bi-Dimensional P2P

  • 摘要: Chord中的所有节点可视作分布在一维空间中,形成单一的环。针对移动Ad hoc网络,该文提出二维P2P的概念,将所有节点视作分布在二维平面内,允许多个可灵活配置的环存在,并提供冗余查询路径。基于此概念,该文还提出多环二维P2P资源发现协议族,并给出协议族中可行的环配置方案,证明其在网络直径和度性能上的改善。仿真结果表明,合理的配置环能明显改善基于移动Ad hoc网络的P2P查询性能。
  • Stoic I, Morris R, and Karger D, et al.. Chord: A scalablePeer-to-Peer lookup protocol for internet applications [J].IEEE Trans. on Networking.2003, 11(1):17-32[2]Rowstron A and Druschel P. Pastry: Scalable, distributedobject location and routing for large-scale Peer-to-Peersystems [C]. IFIP/ACM International Conference onDistributed Systems Platforms Proceedings, Heidelberg,Germany, Nov., 2001: 329-350.Zhao B Y, Kubiatowicz J D, and Joseph A D. Tapestry: Aninfra-structure for fault-resilient wide-area location androuting. Computer Science Division, University of California,Berkeley, Technical Report UCBI/CSD-01-1141, Apr., 2001.[3]Ripeanu M, Foster I, and Iamnitchi A. Mapping the Gnutellanetwork: properties of large-scale Peer-to-Peer systems andimplications for system design [J]. IEEE Internet Computing,2002, 6(1): 50-57.[4]Xu J. On the fundamental tradeoffs between routing tablesize and network diameter in Peer-To-Peer networks [C].IEEE INFOCOM 2003 Proceedings, San Francisco, CA, USA,2003: 2177-2187.[5]Cordasco G, Gargano L, and Hammar M, et al.. F-Chord:Improved uniform routing on Chord. Lecture Notes inComputer Science. Heidelberg, Germany: Spinger Berlin,2004: 89-98.[6]Naor M and Wieder U. Know thy neighbor's neighbor: Betterrouting for skip-graphs and small worlds [C]. 3rdInternational Workshop on Peer-to-Peer Systems Proceedings,La Jolla, CA, USA, 2004: 269-277.[7]Ren X and Gu Z. SA-Chord: A novel P2P system based onself-adaptive joining [C]. 6th IEEE International Conferenceon Grid and Cooperative Computing Proceedings, Urumchi,Xinjiang, China, 2007: 75-81.[8]Flocchini P, Nayak A, and Xie M. Enhancing Peer-to-Peersystems [J].IEEE Journal on Selected Areas inCommunications.2007, 25(1):15-24[9]Yu S, Yu J, and Kamil K, et al.. DR-Chord-FAn efficientdouble-ring Chord protocol [C]. 6th IEEE InternationalConference on Grid and Cooperative Computing Proceedings,Urumchi, Xinjiang, China, 2007: 16-18.[10]Huang C, Hsu T, and Hsu M. Network-aware P2P file sharing[J].IEEE Journal on Selected Areas in Communications.2007,25(1):204-210[11]Chou C, Wei D S L, Kuo C C J, and Naik K. An efficientanonymous communication protocol for Peer-to-Peerapplications over mobile ad-hoc networks [J].IEEE Journalon Selected Areas in Communications.2007, 25(1):192-203
  • 加载中
计量
  • 文章访问数:  3434
  • HTML全文浏览量:  114
  • PDF下载量:  760
  • 被引次数: 0
出版历程
  • 收稿日期:  2007-11-05
  • 修回日期:  2008-04-25
  • 刊出日期:  2009-03-19

目录

    /

    返回文章
    返回