Thomas Leske <[EMAIL PROTECTED]> writes: > The intension of probalistic caching is to keep data longer > available in the network and improve routing. It works by > giving data source nodes a better clue on the global popularity > of the data, because the reloads increase its local popularity. > <SNIP>
let me get this clear, you're proposing to have nodes pretend they don't have data? This seems to have the downside of non-probabilistic caching (ending up throwing out more data from the network) as well as the downside of probabilistic caching (successful requests take longer to find data). It does have the upside that unlike probabilistic caching, it won't make requests fail even when their path goes over a node that has seen the data recently, but I'm still not seeing the worth of this proposal. Thelema -- E-mail: [EMAIL PROTECTED] Raabu and Piisu GPG 1024D/36352AAB fpr:756D F615 B4F3 BFFC 02C7 84B7 D8D7 6ECE 3635 2AAB _______________________________________________ Devl mailing list [EMAIL PROTECTED] http://dodo.freenetproject.org/cgi-bin/mailman/listinfo/devl
