计算机技术与发展2012，Vol.22Issue(8)：43-47,52,6.
基于对等结点指针表优化的Chord算法改进
Improvement of Chord Algorithm by Optimizing Finger Tables for Peer Nodes
摘要
Abstract
A key issue existed in P2P network is how to effectively find the storage node of the resources required. Upon the research on distributed lookup algorithm Chord, it introduces the main idea of distributed hash table (DHT), and elaborates the way of resource keyword search with focus on the analysis of the characteristics of node finger table and the influence of redundant information on the resource search. And then a redundant information coverage method (URFChord) is proposed to improve the finger table at each node. This method requires each node to calculate the redundancy of its finger table , denoted as R (N), delete the redundant information and add a total of R(N) new routing information into the table without increasing the storage space of the finger table. Results from performance analysis and simulation experiments show that this improvement is feasible, and to some extent, it can reduce the average search path length and improve the query efficiency.关键词
P2P/分布式哈希表(DHT)/Chord/冗余度Key words
P2P/ distributed hash table (DHT)/ Chord/ redundancy分类
信息技术与安全科学引用本文复制引用
张姗姗,成卫青,豆仁福..基于对等结点指针表优化的Chord算法改进[J].计算机技术与发展,2012,22(8):43-47,52,6.基金项目
国家自然科学基金资助项目(61170322,71171117) （61170322,71171117）
软件开发环境国家重点实验室开放课题(SKLSDE-2011KF-0X) （SKLSDE-2011KF-0X）
江苏省自然科学基金资助项目(BK2010524) （BK2010524）
