A present for everyone. I have updated experimental with a version of NG routing. This is very much a work in progress. So it uses the formula below for its routing weight. I strongly suspect we need to add some terms to this. For instance, this is not affected by connectFail(s) or queryReject(s) both of which are important. If we do not account for them we end up trying to route to a node that is always failing... And yes this can happen now.
So that brings up the question, what terms do we need to add? and why? Comments? Ed On June 29, 2003 07:48 pm, Ed Tomlinson wrote: > On June 29, 2003 07:24 pm, Ian Clarke wrote: > > > P_best_dnf()*dnf_time(node,key)*htl+(P_dnf(node)-P_best_dnf())* > > > global_success_estimate(key) > > > > You aren't taking into account the time required for the first node to > > DNF before re-requesting. > > > > This solves that problem: > > > > P_best_dnf()*dnf_time(node,key)*htl+(P_dnf(node)-P_best_dnf())* > > (dnf_time(node,key)*htl + global_success_estimate(key)) > > If I factor correctly this works out to: > > P_dnf(node)*dnf_time(node,key)*htl+ > (P_dnf(node)-P_best_dnf())*global_success_estimate(key) _______________________________________________ devl mailing list [EMAIL PROTECTED] http://hawk.freenetproject.org:8080/cgi-bin/mailman/listinfo/devl
