There has been a lot of talk lately about algorithms to make routing better. What about also using a better algorithm for deciding which content to keep on a node, instead of the simple LRU cache? The new algorithm would determine the key least likely to be requested again, and that key is the next one that gets deleted. With this algorithm being improved, data retention across the network should also improve.
Scott Young _______________________________________________ devl mailing list [EMAIL PROTECTED] http://hawk.freenetproject.org:8080/cgi-bin/mailman/listinfo/devl
