Shawn Willden writes: > The same situation applies, though. For any given expansion factor E, > assuming moderately high server reliability, you'll get better net > reliability with N/E-of-N than with 1-of-E. As E goes up, the level of > server reliability required for break-even declines, and the advantage of > erasure coding increases.
I don't understand what you mean. Can you please fill in an example with real numbers? Isn't my scheme simply the most reliable and most expensive form of erasure coding? -- http://noncombatant.org/ _______________________________________________ tahoe-dev mailing list [email protected] http://tahoe-lafs.org/cgi-bin/mailman/listinfo/tahoe-dev
