On Fri, Aug 18, 2000 at 04:02:16PM +0100, Michael ROGERS wrote: <> > I think the only necessary constraints on routing algorithms are those I > outlined in my reply to Oskar: a node should route every insert to somewhere; > a node should route any two inserts with the same key to the same place; a > node should route an insert and a request with the same key to the same > place. This rules out adaptive routing, but it doesn't rule out weighting the > links with fixed weights.
Not that the second constraint isn't even true of the current or any model we have discussed. Where a request/insert gets sent is a function of the current state of the datastore and depends greatly (in fact, it may very well change with every time that key is requested). > > > 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
