On Mon, Jul 31, 2000 at 04:12:38PM +0100, Ian Clarke wrote: > > > Ever since the discussion of file splitting and raid levels, I've been > > casually looking around for algorithms. This looks interesting, but > > unfortunately I'm not a member of the ACM so I can't download the paper. > > Perhaps some kind soul would upload it to Freenet, or make it available in > > some other manner. > > The problem with using an algorithm which will reconstruct data from an > incomplete selection of parts may undermine Freenet's caching. It would > be difficult to persuade client writers to download more parts than are > nescessary, yet this will result in superfluous parts being lost in > Freenet, and you are back to square one. >
Yes, it's a trade off. Better chance of being able to retrieve a complete document right after it's inserted vs. shorter life of all the parts. Add the other benefits already mentioned, and I think it's worth exploring. I'd still like to read that darn paper if I could get ahold of it. David Schutt _______________________________________________ Freenet-dev mailing list Freenet-dev at lists.sourceforge.net http://lists.sourceforge.net/mailman/listinfo/freenet-dev
