Lazy Chord Finger Table Update Algorithm
Dejian Ye · Jisuanji gongcheng · 2010
As lots of errors in Chond search Finger Table(FT) appears,it depresses the searching efficiency when nodes go into or drop out.By discussing and comparing several algorithms of search FT updating,this paper proposes a lazy one to refresh the search FT recursively.The algorithm minimizes the consumption of FT refvesh,it can be an effective fault tolerance mechanism as well.Experimental result shows the correctness and effectiveness of the algorithm.