On Mon, Apr 23, 2001 at 10:20:22PM +0200, Stefan Reich wrote:
> From: "Tavin Cole" <[EMAIL PROTECTED]>
> > 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.
>
> Selective caching has its drawbacks too... the data store will lose the
> convenient local caching function it has now. When I open the same file a
> second time, there is a chance I will have to wait for it to load through
> Freenet again - rather than pop up from the local data store instantly.
>
> Is this a convenience versus deniability question? It could actually become
> a runtime option.
If it was possible to quickly nuke the datastore but not the reference table, it
would be really useful re deniability.
>
> -Stefan
--
Anarchists who refuse to learn the use of computer networks deserve to
live in slavery
-- with apologies to Leon Trotsky
_______________________________________________
Devl mailing list
[EMAIL PROTECTED]
http://lists.freenetproject.org/mailman/listinfo/devl
