[chord] Maintaining the finger table in CHORD

[Frank Dabek]

Qasem,

	Each second one of the finger table entries is updated. An entry is
updated by performing a lookup for the beginning of the range that the
given finger is a part of (e.g the second range is [n + 2^2, n+2^3]
where n is the node's id). If the lookup returns the current finger
entry, it is correct. Otherwise the current entry is replaced. As an
optimization we can first check to see if the current finger's
predecessor is after start; if so we do a full lookup otherwise the
finger is still correct.

--Frank

On Tue, 2003-08-26 at 15:42, qasem kharma wrote:
> Dear Sir/Madam,
> 
> I have a question about maintaining the finger table in CHORD algorithm. I
> understand that the finger table is not critical for routing, and the
> algorithm is not aggressive to maintain it; however, the finger table
> helps to reduce the number of hops needed to route a request. I could not
> find any reference describing an algorithm to maintain the finger table.
> Please, could you provide me with information about the mechanism you are
> using for maintaining the finger table? Did you publish any paper related
> to maintaining the finger tables in case of a new node joining or a node
> leaving? What is the complicity of maintaining the finger table?
> 
> Thanks and Best Regards,
> 
> Qasem Kharma
> 
> 
> 
> 
> _______________________________________________
> chord mailing list
> chord at amsterdam.lcs.mit.edu
> https://amsterdam.lcs.mit.edu/mailman/listinfo/chord