> I don't think this is really a problem. The thing is, the routing is not > absolute -- it's not the case that globally, 123.56.78.* might have a > really big affinity for the hash of the keyword mp3. Each node decides for > itself which target it thinks might have an affinity for mp3, based on > "past experience." If we draw all those associations as a graph, it's > possible all the arrows would go towards a single node, but more likely > they would swirl into a stream that loops around and doesn't go anywhere in > particular.
I don't think so. If Freenet is going to work, each request must overlap with the path of the insert. Otherwise a request will not find data which has been inserted but not yet requested. And of course if the first request doesn't work, the data won't get spread and later requests won't be any more successful. Therefore overlaps must occur. This must be true even though HTL is pretty small, 5-10. Therefore the routing must be precise enough that this 5-10 step path overlaps with the 5-10 step path taken by the insert. This suggests to me a pretty accurate and narrow targetting. Furthermore, the routing algorithm is the same for inserts as for requests, so overlaps occur for inserts as well. If someone inserts under key "mp3" it goes onto 5-10 nodes. Assuming we allow multiple docs per key, every such insert will overlap with each other on at least one of those 5-10 nodes. (And once the two paths cross they will probably join and stay together for the remainder of the HTL.) Therefore there will be nodes which will have at least 1/5 to 1/10 of all "mp3" keys stored in Freenet. Hal _______________________________________________ Freenet-dev mailing list Freenet-dev at lists.sourceforge.net http://lists.sourceforge.net/mailman/listinfo/freenet-dev
