On Thu, 16 Dec 2010, Julian Cain wrote:
> Chord doesn't have the routing instabilities of kademlia. If your tree isn't > balanced then you will get unstable routing with kad. A kad tree doesn't > balance until about 2048 nodes are present. Again chord doesn't have this > fault as long as you've got your P and S. I want to point that although the predecessor and successor are not specified in Kad, they can be implemented just like Chord, in order to support consistency. When comparing DHTs, a common mistake is to compare DHTs as exactly specified in the papers. The same holds for the number 2048 you mentioned for balance trees, which is an engineering parameter and not an algorithmic one. -salman Similarly, 2048 is not an algorithmic but an engineering > >> Cheers >> >> <loic.vcf> >> _______________________________________________ >> p2p-hackers mailing list >> [email protected] >> http://lists.zooko.com/mailman/listinfo/p2p-hackers > _______________________________________________ > p2p-hackers mailing list > [email protected] > http://lists.zooko.com/mailman/listinfo/p2p-hackers > > _______________________________________________ p2p-hackers mailing list [email protected] http://lists.zooko.com/mailman/listinfo/p2p-hackers
