On Tue, Dec 26, 2000 at 07:28:40PM -0600, Brandon wrote:
> 
> > > is only one hop worse than path compression occuring between the given
> > > cluster node and other nodes.
> > Yeah, but with a fully connected graph, you'd need a far greater number of
> > hops to locate a document than in a small-world graph.  Too large for
> > Freenet to be effective.
> 
> No, with a fully connected graph you are one hop away from the
> "epicenter". A fully connected graph is actually ideal in terms of
> efficiency because the local maxima for closeness is also the global
> maxima for closeness.
Sorry, I thought you were talking about the entire Freenet, not a cluster.

> A clusters don't eliminate small world graphs for the public network. They
> only mandate that a node in the public network can be a minimum of 2 hops
> from any node in a cluster instead of 1.
Which may cause problems for neighboring clusters.

-- 
grills octet roger my

PGP signature

Reply via email to