Todd Walton: > It *can* be squeezed into small and odd-shaped corners without > degrading the performance of the network as a whole. The issue > here is figuring out how, that's all.
I concede your point and add only that neither of the two routing algorithms in discussion seem to be capable of this feat. The present algorithm is blind to latency, and the introduction of slow nodes would ruin the network's performance. The proposed algorithm is just the opposite--acutely sensitive to latency, it would react to the introduction of slow nodes by ignoring them completely. _______________________________________________ devl mailing list [EMAIL PROTECTED] http://hawk.freenetproject.org:8080/cgi-bin/mailman/listinfo/devl
