|
3#

楼主 |
发表于 2008-9-13 11:49:46
|
只看该作者
All you have to do now, therefore, is select a suitable number of points from along the polynomial (these need not be the original ones) and convert their values into the appropriate mathematical constructs. Scatter these around the host computers and, when someone wants to look at the file, he need recover only 100 of them to have enough data to reconstruct the file from scratch. To have 100 points available 999,999 times out of a million it turns out that you need to scatter a total of 600 of them around. That is an amount of data equivalent to six versions of the original file, rather than the 100 that would be needed to achieve the same level of reliability if whole files were being stored. Moreover, the system needs the computers linked to it to be available for only 17% of the time, rather than 25%, for this to apply.
Online storage is a growing market, especially for backing up data, where reliability is a big concern. Most commercial online-storage services use centralised servers. Although these are generally reliable, they do sometimes fail. And when they do, the results are embarrassing—as Amazon, an online shopping company, learnt on two occasions this year when the servers for its commercial data-storage system went down for several hours at a time.
Though some people may feel squeamish about scattering their data over hundreds of other computers (even though it will be encrypted), or storing unknown file fragments on their own, Mr Grolimund is adamant that Caleido has learnt from other “peer-to-peer” file-sharing systems, and that Wuala is built to handle concerns about the illegal distribution of copyrighted or “inappropriate” content. If he is right, Wuala may prove that, for online data storage, it is as good to give as it is to receive. |
|