> No, this one's trivial to solve. We've talked about doing selective caching > in 0.4 or soon after. Nodes should incorporate a simple key closeness > judgment as well as a load balancing judgment in the selective cache test. > Then if you request all parts of a splitfile, your node will only cache > some of them.
The threat is not in that you will have *all* parts of a file, but in that you will have a suspiciously large number of parts so that it is clear that you personally requests the file. I doubt that selective caching will change the caching significantly enough that your cache contents seem random. Perhaps if you totally rewrote the caching algorithm so that it *only* cared about key closeness. Then your cache contents would have very little relation to which files you've requested. _______________________________________________ Devl mailing list Devl at freenetproject.org http://lists.freenetproject.org/mailman/listinfo/devl >From - Tue Apr 24 09:40:05 2001 Return-Path: <devl-admin at freenetproject.org> Received: from hawk.freenetproject.org (postfix@[4.18.42.11]) by funky.danky.com (8.9.3/8.8.7) with ESMTP id SAA01149 for <danello at danky.com>; Mon, 23 Apr 2001 18:16:52 -0400
