OHChord:基于优化路由表和路由热点的Chord改进  

OHChord:Improvement of Chord Routing Algorithm Based on Optimized Routing Table and Hot Point

作　　者：王德永[1] 王晓光[1] 齐应杰[1] 张少龙[1] 

机构地区：[1]平顶山工业职业技术学院计算机系,河南平顶山467001

出　　处：《计算机与现代化》2011年第9期57-60,共4页Computer and Modernization

摘　　要：在P2P系统和网格计算中如何高效定位所需资源是目前的一个研究热点。Chord是一种基于DHT技术的结构化P2P路由协议,具有完全分布式、负载均衡、可用性及可扩展性好等特点。但其路由表结构具有一定的冗余信息,定位效率不高。本文提出基于优化路由表和路由热点的OHChord算法,一方面优化Chord路由表,除去冗余信息,另一方面为Chord中每个节点增加热点路由表。与标准Chord和P_Chord相比,OHChord提高了查询效率。It is a hot issue to study how to locate the resource efficiently in P2P networks and grid computing.Chord is a structured P2P routing protocol based on DHT,with the features of fully distributed,load balancing and availability and so on.But it is of a poor performance because of redundant information in the finger table.In this paper,OHChord is proposed.It reduces redundancy and improves query stability by two methods.Firstly,an improved finger structure is presented for removing redundancy.Secondly,a hot routing table is added for each node.Comparing with the original Chord and partitionbased Chord,OHChord can improve the resource retrieving efficiently.

关 键 词：CHORD路由算法 分布式哈希表 路由热点 资源定位 

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