%0 Journal Article
%A CHENG Ming-zhi
%A JIA Zhong-tian
%A LUO Shou-shan
%A QING Si-han
%A XIE Chui-yi
%T Semi-Random Linear Network Coding for Cloud Storage Redundancy
%D 2013
%R 10.13190/jbupt.201303.31.xiechy
%J Journal of Beijing University of Posts and Telecommunications
%P 30-34
%V 36
%N 3
%X <p>According to structural characteristics and availability requirements of cloud storage, a semi-random linear network coding (SRLNC) algorithm is proposed for data redundancy. The data block is split into pieces, encoded by coding matrix composed of unit row vectors and random row vectors on finite fields GF(2<sup><em>s</em></sup>), stored in data nodes dispersedly. In decoding process, the data block can be restored with the strategy of unit row vectors priority. The probability of unique solution is analyzed for SRLNC decoding equations, a new operations per character index is defined to measure algorithm efficiency. Experiments prove that the operating time of the decoding process in the proposed algorithm exponentially reduces with the increase of the node availability. When the availability of each node&ge;0.8 and redundancy&le;3, the encoding operation of the proposed algorithm is faster up to 33%, and decoding operation of the proposed is 5 times faster than that of random linear network coding algorithm, respectively. It is shown that the proposed algorithm is applicable to &quot;write once read many&quot; cloud storage system.</p>
%U https://journal.bupt.edu.cn/EN/10.13190/jbupt.201303.31.xiechy