On July 3, 2003 10:24 pm, [EMAIL PROTECTED] wrote: > Alright, can someone give a quick overview of the NGRouting, like Ian gave > at his talk at Stanford...I think it was? > > The idiot sitting here in this chair wishes enlightenment beyond taoism.
NG is really quite simple. What it does is attempt to find the route that will respond fastest for a given key. It does this by tracking how long various events take. The current routing alg is based on node references. ie. if a node has seen keys near the key we are looking for, then route to it if its CP (which is a _guess_ of the probablity that we can contact that node) is amoung the best. Problem with CP routing is that the speed of response is not taken into account. So while it can find the data, its not optimal time wise. NG attempts to find the data and use an optimal path time wise. Another factor in NG is that we attempt to reduce (or eliminate) alchmey. Meaning we use use measurements and math to make our choises. All in all NG should do a better job - a version of NG is in the experimental branch on cvs. Ed _______________________________________________ devl mailing list [EMAIL PROTECTED] http://hawk.freenetproject.org:8080/cgi-bin/mailman/listinfo/devl
