On 21 Sep 2005, at 17:30, Alex R. Mosteo wrote:
Matthew Toseland wrote:
The main outstanding issue is how frequently we should do path
folding.
If it is too slow, it will take too long to converge. But if it is
too
fast, then oskar's routing algorithm won't be able to keep up. Is
there
any way to determine an optimal time short of alchemy?
Is there some wiki/doc with further explanation of oskar's
algorithm and
path folding details? I would like to understand it properly.
Right now just the slides of Oskar's and my presentation at Defcon/
Blackhat, Others have found this sufficient to explain the algorithm:
http://www.math.chalmers.se/~ossa/defcon13/
Ian.
_______________________________________________
chat mailing list
chat@freenetproject.org
Archived: http://news.gmane.org/gmane.network.freenet.general
Unsubscribe at http://dodo.freenetproject.org/cgi-bin/mailman/listinfo/chat
Or mailto:[EMAIL PROTECTED]
