> Suppose I'm at a college with 100 nodes out of a million in the world, > and all of those 100 nodes have much better communication performance > with each other, compared with any node outside the college network. > That means that all 5 of my hops are likely to go to college nodes, if > we have an algorithm that gives preference in this way. If my data's > not at the college, I won't find it.
This is exactly the problem I was pointing out with TimedOut. I think that the way that nodes will be configured is that you will have a few references to your college network (say 3) and then a few to other networks (freenet developer's network, Bill's Super Freenet Cluster, and some place in Finland). If it's in the college network, you don't want it all of your HTL to get sucked up by the nation of Finland. If it's in the Internet somewhere, you don't want your HTL to get sucked up by the college network. The easy, simple, and very workable solution to this is to have some hops go to each of the nodes you know about. That way each network gets a chance to provide the data within a given HTL. The trick, of course, is coming up with an algorithm that doesn't grow too fast. My last proposal was to divide the HTL by the number of nodes it will be sent to. Also, a separate Depth field can be set to specify the maximum number of references to use. That way the growth of messages and how long they take is carefully controlled and mathematically determined to be a known quantity. _______________________________________________ Freenet-dev mailing list Freenet-dev at lists.sourceforge.net http://lists.sourceforge.net/mailman/listinfo/freenet-dev
