On Wed, 02 Aug 2000, you wrote: > Bram writes: > > > I'm trying to change the logic to decide which neigbor to send a file to > > to be based on comparison in a ring - where's the code which does this? I > > just spent a while trying to figure it out. > > Changing the forwarding logic should not be done lightly, as it is important > that all nodes use the same logic so that requests can find inserted data.
I would like to second that. Not only is it something that has to be considered, it will be impossible to see any feedback from your changes unless you can convince hundreds of people to run your version and try to see if your network runs better then ours. A better idea is to use Serapis (the freenet simulator). Making changes to the DataStore might be more difficult (for efficiency I wrote a tree, so that assumes an order, which is a ring comparison won't have), but you can replace it with a simple linear one. Serapis is even deeper in alpha then Freenet, of course. > However, the basic function is findClosestKey in node/StandardDataStore.java. <> >-- \oskar _______________________________________________ Freenet-dev mailing list Freenet-dev at lists.sourceforge.net http://lists.sourceforge.net/mailman/listinfo/freenet-dev
