On 12/1/06, Alex Pankratov <[EMAIL PROTECTED]> wrote:
Specifically, I'm curious about two things - dynamic restructuring of the cluster in the event of the connectivity loss between its nodes and the handling of non-2^n nodes case.
Diego Doval created a Resource Location and Discovery system called Manifold, which is based on two overlay networks. The first, known as Manifold-b, is used for inexact search while the second, Manifold-g, is used for exact search. Manifold-g is a DHT based on a hypercube topology. Since a DHT should never contain all 2^n nodes, he devised a solution to this problem which involved nodes in the network taking responsibility for the missing ones. His thesis [1] and a brief explanation of the Manifold-g algorithm [2] may be of interest. rob [1] http://www.dynamicobjects.com/manifold/archives/thesis.pdf [2] http://www.dynamicobjects.com/manifold/archives/2004/12/a_bit_more_on_m.html
_______________________________________________ p2p-hackers mailing list [email protected] http://lists.zooko.com/mailman/listinfo/p2p-hackers
