Adding new nodes to Kademlia, building Kademlia routing tables

Question

I can\'t quite wrap my brain around the joining process of Kademlia DHTs. I\'ve seen a few tutorials and presentations online, but they all seem to say things the same way and a

Answer 1

My guess is it uses some super nodes and geospatial informations to compute a minimum spanning tree. It can also compute a voronoi-diagram or the dual delaunay triangulation from the super nodes and use it to run a proximity search. Here is an example: http://www.mathworks.de/de/help/matlab/math/spatial-searching.html.