It works quite similar to probalistic caching. The nodes always cache the data, but behave nearly the same way as if they did not.
I don't see how that could possibly benefit anyone. And it makes flooding attacks as easy as they were before pcaching i.e. very easy.
You can put the defense against flooding attacks into the caching algorithm instead: Probalisticly mark some new data items as preferably cached. Reserve the last few entries in the LRU cache for preferably cached items. Other items will be dropped, when they would be moved to a reserved entry otherwise.
This way it becomes harder to make a number of nodes drop the same data.
-- Thomas Leske
_______________________________________________ Devl mailing list [EMAIL PROTECTED] http://dodo.freenetproject.org/cgi-bin/mailman/listinfo/devl
