基于Chord扩展的对等定位模型研究
|
摘要
为减少对等网络资源定位过程中的路由跳数,提高路由效率,在研究Chord定位模型的基础上,提出了一种基于历史资源相关度的Chord扩展定位方法。利用网络中节点请求资源的访问局部性,通过计算搜索路径上节点与所查资源的相关度,将资源副本存储在相关度高的节点上,减少相同资源搜索的路由跳数;在节点中保存友邻缓存表,提高互访频繁节点的资源定位效率,缩短平均路径长度。模拟实验表明,随着查询消息的增加,扩展后的定位模型有效减少了平均路由跳数和平均查询时延,提高了资源定位的效率。
To reduce the routing hops and improve the routing efficiency of resource location in structured peer-to-peer network,based on Chord,an extended locating method is presented.The method is based on correlation degree of historical keys.Peers searching for resources have the property of locality.Using this property and calculating the correlation between the requested resource and nodes on searching path,resource replica is stored on the nodes with high correlation and the routing hops are reduced when searching for the same resource.With storing the friendly neighbor table on each node,the efficiency of resource location is improved for searching among nodes visited each other frequently,and the average path length is reduced.The simulation results show that the extended location model can reduce the average routing hops and the average searching delay with the increasing of searching messages,and the efficiency of resource location is improved.
To reduce the routing hops and improve the routing efficiency of resource location in structured peer-to-peer network,based on Chord,an extended locating method is presented.The method is based on correlation degree of historical keys.Peers searching for resources have the property of locality.Using this property and calculating the correlation between the requested resource and nodes on searching path,resource replica is stored on the nodes with high correlation and the routing hops are reduced when searching for the same resource.With storing the friendly neighbor table on each node,the efficiency of resource location is improved for searching among nodes visited each other frequently,and the average path length is reduced.The simulation results show that the extended location model can reduce the average routing hops and the average searching delay with the increasing of searching messages,and the efficiency of resource location is improved.
引文
[1]YANG Feng,LI Fengxia,YU Hongliang,et al.A hybrid peer-to-peer lookup service algorithm on distributed hash table[J].Journal of Software,2007,18(3):714-721(in Chinese).[杨峰,李凤霞,余宏亮,等.一种基于分布式哈希表的混合对等发现算法[J].软件学报,2007,18(3):714-721.]
[2]Guo Jun,Chen Chen.Research on chord searching algorithmbase on cache strategy[J].Physics Procedia,2012,25:905-910.
[3]QI Yu,ZHANG Xinyou.Analysis and improvement of fingertable in chord protocol[J].Computer Engineering and Design,2010,31(6):1170-1172(in Chinese).[祁玉,张新有.chord路由表结构的分析与改进[J].计算机工程与设计,2010,31(6):1170-1172.]
[4]CHEN Guihai,LI Zhenhua.Peer-to-Peer:structure,applica-tion and design[M].Beijing:Tsinghua University Press,2007(in Chinese).[陈贵海,李振华.对等网络:结构、应用与设计[M].北京:清华大学出版社,2007.]
[5]Chiola G,Cordasco G,Gargano L,et al.Optimizing the fin-ger tables in chord-like DHTs[C]//Santa Fe,New Mexico:Parallel and Distributed Processing Symposium,2006:143-151.
[6]Novak D,Zezula P.M-Chord:A scalable distributed similari-ty search structure[C]//Hong Kong,China:Proceedings ofthe 1st International Conference on Scalable Information Sys-tems,2006:1-10.
[7]Eric J L L,Yungfa H,Shuchiu L.ML-Chord:A multila-yered P2Presource sharing model[J].Journal of Network andComputer Applications,2009,32(1):578-588.
[8]Joung Yuh-Jzer,Wang Jiaw-Chang.Chord2:A two-layerchord for reducing maintenance overhead via heterogeneity[J].Computer Networks,2007,51(3):712-731.
[9]HE Daode,DENG Xiaoheng.P2Prouting algorithm based onpysical location and access locality[J].Computer Engineering,2009,35(8):146-149(in Chinese).[贺道德,邓晓衡.基于物理位置与访问局部性的P2P路由算法[J].计算机工程,2009,35(8):146-149.]
[10]LI Mingtao,LUO Junyong,YIN Meijuan,et al.Weightcomputing method for text feature terms by integrating wordsense[J].Journal of Computer Applications,2012,32(5):1355-1358(in Chinese).[李明涛,罗军勇,尹美娟,等.结合词义的文本特征词权重计算方法[J].计算机应用,2012,32(5):1355-1358.]
[2]Guo Jun,Chen Chen.Research on chord searching algorithmbase on cache strategy[J].Physics Procedia,2012,25:905-910.
[3]QI Yu,ZHANG Xinyou.Analysis and improvement of fingertable in chord protocol[J].Computer Engineering and Design,2010,31(6):1170-1172(in Chinese).[祁玉,张新有.chord路由表结构的分析与改进[J].计算机工程与设计,2010,31(6):1170-1172.]
[4]CHEN Guihai,LI Zhenhua.Peer-to-Peer:structure,applica-tion and design[M].Beijing:Tsinghua University Press,2007(in Chinese).[陈贵海,李振华.对等网络:结构、应用与设计[M].北京:清华大学出版社,2007.]
[5]Chiola G,Cordasco G,Gargano L,et al.Optimizing the fin-ger tables in chord-like DHTs[C]//Santa Fe,New Mexico:Parallel and Distributed Processing Symposium,2006:143-151.
[6]Novak D,Zezula P.M-Chord:A scalable distributed similari-ty search structure[C]//Hong Kong,China:Proceedings ofthe 1st International Conference on Scalable Information Sys-tems,2006:1-10.
[7]Eric J L L,Yungfa H,Shuchiu L.ML-Chord:A multila-yered P2Presource sharing model[J].Journal of Network andComputer Applications,2009,32(1):578-588.
[8]Joung Yuh-Jzer,Wang Jiaw-Chang.Chord2:A two-layerchord for reducing maintenance overhead via heterogeneity[J].Computer Networks,2007,51(3):712-731.
[9]HE Daode,DENG Xiaoheng.P2Prouting algorithm based onpysical location and access locality[J].Computer Engineering,2009,35(8):146-149(in Chinese).[贺道德,邓晓衡.基于物理位置与访问局部性的P2P路由算法[J].计算机工程,2009,35(8):146-149.]
[10]LI Mingtao,LUO Junyong,YIN Meijuan,et al.Weightcomputing method for text feature terms by integrating wordsense[J].Journal of Computer Applications,2012,32(5):1355-1358(in Chinese).[李明涛,罗军勇,尹美娟,等.结合词义的文本特征词权重计算方法[J].计算机应用,2012,32(5):1355-1358.]