Talk:Chord (distributed hash table)
From Wikipedia, the free encyclopedia
An example of a diagram (though copyrighted) can be found in this PDF file.
- The article has various mentions of the diagram and since the diagram is missing this leads to confusion. Toufeeq 06:12, 24 December 2006 (UTC)
[edit] Pseudocode for find_successor
I believe there is a mistake in the pseudocode, from my understanding there is a missing line above 'return successor.find_successor(id);'. The version of pseudocode used for find_successor is only useful when stepping node by node round the circle, but the proper version using the finger table (as it is suggested this is, with the closest_preceding_node code) requires a call to that function.
Original: // ask node n to find the successor of id
n.find_successor(id) if (id\in(n, successor)) return successor; else // forward the query around the circle return successor.find_successor(id); // search the local table for the highest predecessor of id n.closest_preceding_node(id) for i = m downto 1 if(finger[i]\in(n,id)) return finger[i]; return n;
Proposed: // ask node n to find the successor of id
n.find_successor(id) if (id\in(n, successor)) return successor; else // forward the query around the circle n' = closest_preceding_node(id)
return n'.find_successor(id); // ADDED LINE // search the local table for the highest predecessor of id n.closest_preceding_node(id) for i = m downto 1 if(finger[i]\in(n,id)) return finger[i]; return n;
I apologise if it would have been more appropriate to simply edit the post but in the case of such a hidden error if my code were incorrect it could cause many more problems.
[edit] Move
I suggest moving this page to "Chord (DHT)". The current title, "Chord project", doesn't capture what's important here, i.e., the design of the DHT itself. --Nethgirb 10:50, 2 March 2007 (UTC)
- I've moved it now to Chord (distributed hash table), per WP:ACRONYM, since DHT is not a widely used abbreviation. GregorB (talk) 20:45, 29 January 2008 (UTC)