Now I am writing an implementation of Kademlia. I encounter problem in
understanding the "bucket split" operation.
In the paper "Kademlia: A Peer-to-Peer Information System Based on the
XOR Metric", the author wrote:
"One complication arises in highly unbalanced trees. Suppose node u
joins the system and is the only node whose ID begins 000. ...... When
u refreshes the split buckets, all nodes with prefix 001 will learn
about it"
I don't see why it's necessary to do so. Can someone
explain in more detail?
Thanks!
--
yours sincerely,
Jeff
_______________________________________________
p2p-hackers mailing list
[email protected]
http://lists.zooko.com/mailman/listinfo/p2p-hackers
