On Wed, 2003-04-02 at 19:26, Ian Clarke wrote: > I have given some thought to the next generation routing > algorithm, and how to implement it efficiently. > > the idea is to efficiently store information about each node's > response times for specific keys. The challenge is to store this > information efficiently, while allowing efficient response time > estimation for a given key with a given node.
This is a great idea, but I see one problem. What if a malicious node just responds quickly but "trickles" the data at something like 10 bytes/minute? Should transfer speed also be taken into consideration with this algorithm? I could see a node serving up dozens of connections over a dialup link because of low latency (even though the bandwidth is low), while a satellite broadband user would be more latent but get the actual data to the node quicker. A low-latency 0.5 k/sec connection would get you a 1 MB SplitFile block much slower than a high-latency 10k/sec connection. Scott Young _______________________________________________ devl mailing list [EMAIL PROTECTED] http://hawk.freenetproject.org:8080/cgi-bin/mailman/listinfo/devl
