Article ID Journal Published Year Pages File Type
473975 Computers & Mathematics with Applications 2006 8 Pages PDF
Abstract

Replication is a key technology of distributed storage systems. In this paper, an indirect replication algorithm is proposed following the intrinsic characteristic of distributed storage systems and the peer-to-peer model. In the indirect replication algorithm, the data object is partitioned into several data blocks. These data blocks are encoded in order that there is data redundancy between data blocks. Comparing with the traditional replication algorithm, the indirect replication algorithm has less granularity of replication, less bandwidth and storage costs, and provides higher availability, durability, and security. The performance evaluation shows that the encoding and decoding times are proportional to the data size, and that the irregular cascade bipartite graphs are of great advantage in improving the success ratio of data recovery. Finally, if the number of data blocks used to recover the data object is larger than a certain value, the success ratio of data recovery approaches 100%.

Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)