基于Chord扩展的对等定位模型研究

发布时间：2018-02-04 01:10

本文关键词： 结构化对等网络 Chord协议访问局部性路由算法资源定位　出处：《计算机工程与设计》2013年05期 　论文类型：期刊论文

【摘要】：为减少对等网络资源定位过程中的路由跳数,提高路由效率,在研究Chord定位模型的基础上,提出了一种基于历史资源相关度的Chord扩展定位方法。利用网络中节点请求资源的访问局部性,通过计算搜索路径上节点与所查资源的相关度,将资源副本存储在相关度高的节点上,减少相同资源搜索的路由跳数;在节点中保存友邻缓存表,提高互访频繁节点的资源定位效率,缩短平均路径长度。模拟实验表明,随着查询消息的增加,扩展后的定位模型有效减少了平均路由跳数和平均查询时延,提高了资源定位的效率。
[Abstract]:In order to reduce the number of routing hops and improve the routing efficiency in the process of resource location in peer-to-peer network, the Chord localization model is studied. In this paper, a Chord extended localization method based on historical resource correlation is proposed. By using the local access of the resource requested by the node in the network, the correlation between the node in the search path and the resource is calculated. A copy of the resource is stored on a highly correlated node to reduce the number of routing hops for the same resource search; In order to improve the efficiency of resource location and shorten the average path length of frequent nodes, the simulation results show that with the increase of query messages, the cache table is saved in the nodes. The extended location model effectively reduces the average number of routing hops and the average query delay, and improves the efficiency of resource location.
【作者单位】：河南科技大学电子信息工程学院;
【基金】：国家自然科学基金项目(61003234)
【分类号】：TP393.02
【正文快照】： 0引言结构化P2P网络是全分布式的对等网络系统,通过分布式散列表(DHT)将节点、资源分布于覆盖网中,可以在O(logN)跳内完成对象定位[1],典型的结构化P2P模型有Chord,CAN,Tapestry等[2]。Chord由MIT提出[3],每个节点和资源通过一致性散列被分配唯一的m位节点标识符NodeID和资源

【参考文献】