基于Chord模型的资源搜索机制的研究  

Research on Resource Search Mechanism Based on the Chord Model

作　　者：冯新[1] 

机构地区：[1]湖南涉外经济学院计算机科学与技术学院,长沙410205

出　　处：《计算机与数字工程》2012年第2期32-34,共3页Computer & Digital Engineering

摘　　要：论文在深入分析Chord资源搜索机制的基础上,针对其存在的问题提出了改进的方案。通过使用一个统一的数学模型来增加节点拥有的路由信息,同时,合并冗余的路由项,使得在节点增加了路由信息的同时没有增加节点路由表的规模。该方案还能够使节点对键值落在不同标识符区域的资源进行搜索时所需路由跳数的差异变小。改进的方案使资源搜索的性能更加稳定,资源查询消息的平均路由跳数更少,对节点的资源的占用更少。路由查询消息时节点所需的处理时间更短等优点。Thorough analysis Chord resources search mechanism,the paper proposed the improved plan in view of its existence＇s question.The scheme includes a mathematic model for adding routing information to the routing tables of peers.Meanwhile,it holds down the scale of routing tables by merging the items that have redundant information.In most cases,it makes the peers in a Chord network have actually even less items in the routing tables than they used to.Compared to the standard mechanism of searching resources in Chord model,it also has the advantage that the deviation of hops which are needed for routing query messages to find resources whose key values locate in different identifier spaces becomes smaller.Thus,it makes the performance of searching resources more stable,the average hops of routing query messages deminished.It also makes the routing tables of peers consumes less memory and the time for peers to route query messages get shorter.

关 键 词：P2P网络 CHORD网络 资源搜索算法 分布式哈希表 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]