Abstract: How to locate efficiently the node that stores desired resource is a core problem in P2P networks and grid computing. Chord is a successful resource location protocol in P2P systems, but its lookup efficiency is lower because finger table has redundant information. An improved and optimal finger structure is presented for removing the shortages of the original chord finger and getting higher location efficiency.
The average query path length can be shortened from (1/2)logN to (1/2)logN-(1/4)logR(N), and lookup efficiency can be heightened obviously.

Key words: peer-to-peer(P2P), finger table, Chord, DHT

摘要： 如何高效定位所需资源是P2P网络和网格计算中的一个核心问题。P2P资源定位协议Chord的路由表结构含有一定的冗余信息，导致查询效率不高。针对该缺陷，文章对其进行改进与优化，使平均查询路径长度由(1/2)logN缩短到(1/2)logN-(1/4)logR(N)，查询效率明显提高。

关键词: P2P, 路由表, Chord, 分布式哈希表

CLC Number: 

• TP393