Optimization and Improvement of Finger Table in Chord Protocol
Zhong Le-hai · Jisuanji gongcheng · 2007
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 12 log N to 12logN? 14 log R(N),and lookup efficiency can be heightened obviously.