Advanced Search
Volume 31 Issue 3
Dec.  2010
Turn off MathJax
Article Contents
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

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

doi: 10.3724/SP.J.1146.2007.01740 cstr: 32379.14.SP.J.1146.2007.01740
  • Received Date: 2007-11-05
  • Rev Recd Date: 2008-04-25
  • Publish Date: 2009-03-19
  • 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.
  • loading
  • 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
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (3467) PDF downloads(761) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return