On Fri, Aug 18, 2000 at 11:59:05AM +0100, Michael ROGERS wrote: > >> Surely the routing will still work as long as a given node uses the same > >> algorithm for routing inserts as it uses for routing requests? > > > >Obviously not. Sending both requests and inserts to any random node in the > >datastore will not cause it to work. Not sending both requests and inserts > >anywhere will not work either. And nor will sending them to the node to > >which you have the fastest connection. > > OK, any deterministic algorithm. No, scratch that - any function.
No, and besides what we were discussing was not realistically deterministic. Don't send to anybody is still deterministic. Don't send to anybody who's ip is on a class A network is also deterministic (f(x) = 0 is a function). Try "send to the node from which you have the most previous responses" and see what happens then. The assumption is that it works if you have a working closness relation and you apply it to the keys, regardless of the specifics of that relation. Nobody has proved even that though. > > > Michael > > _______________________________________________ > Freenet-dev mailing list > Freenet-dev at lists.sourceforge.net > http://lists.sourceforge.net/mailman/listinfo/freenet-dev > -- \oskar _______________________________________________ Freenet-dev mailing list Freenet-dev at lists.sourceforge.net http://lists.sourceforge.net/mailman/listinfo/freenet-dev
