On Fri, Nov 21, 2003 at 12:10:26PM +0000, Ian Clarke wrote:Ian Clarke wrote:It seems that we aren't seeing the hoped-for specialization in NGR.
There are several possible solutions to this, the obvious one being to
A more refined approach may be to have "offline probing". Basically we have a process which every-so-often randomly selects a node and requests a key from it. The key can be one that was previously retrieved from another node. This request is used to educate the estimators of nodes which may not otherwise ever have requests sent to them.
Implementation:
Node estimators start off pessimistic, but with an initial specialization.
Every 30 (tunable, lower on nodes not getting any traffic) seconds, we pick a random key from a table we keep of recently requested keys, and request it at HTL 25 from the node with the lowest number of reports of events in its estimator (choosing randomly if several nodes have 0).
Just a question here, could keys that have been inserted through our node be better candidates for this probing method ? I think these keys have different properties in the context of NGR, but I'm only guessing here. It might be worth thinking about. or not.
Ken
_______________________________________________ Devl mailing list [EMAIL PROTECTED] http://dodo.freenetproject.org/cgi-bin/mailman/listinfo/devl
