One thing that always bothered me about NGrouting is that we only antisipate having to retry once.
Originally I wanted to use a Ramon sum to determine the overall time but Ian pointed out that we don't want to retry infinitely.
It occurred to me that NGrouting estimates the time for success and then the time to retry if we fail and multiplies each by their respective probabilities. It occurs to me that what we are trying to maximize is the probability that within any given time T we will have the highest probability of having the data. However we know the time T we are trying to optimize for, it is the timeout.
Which timeout? (what calculation)
To me trying to get the lowest time per success assuming the data exists makes more sense than fixing a time and calculating which is most likely to succeed.
Neither encourages the specialisation of paths but would make best selfish use if specialisation existed.
_______________________________________________ Devl mailing list [EMAIL PROTECTED] http://dodo.freenetproject.org/cgi-bin/mailman/listinfo/devl
