semi-random linear network coding for cloud storage redundancy

CORC > 软件研究所 > 软件所图书馆 > 期刊论文

	semi-random linear network coding for cloud storage redundancy
	Xie Chui-Yi ; Jia Zhong-Tian ; Qing Si-Han ; Luo Shou-Shan ; Cheng Ming-Zhi
刊名	Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications
	2013
卷号	36 期号:3 页码:30-34
关键词	Algorithms Decoding Linear networks Network coding Redundancy Vectors
ISSN号	1007-5321
中文摘要	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^s), 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≥0.8 and redundancy&le3, 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 "write once read many" cloud storage system.
英文摘要	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^s), 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≥0.8 and redundancy&le3, 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 "write once read many" cloud storage system.
收录类别	EI
语种	中文
公开日期	2013-09-17
内容类型	期刊论文
源URL	[http://ir.iscas.ac.cn/handle/311060/15670]
专题	软件研究所_软件所图书馆_期刊论文
推荐引用方式 GB/T 7714	Xie Chui-Yi,Jia Zhong-Tian,Qing Si-Han,et al. semi-random linear network coding for cloud storage redundancy[J]. Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications,2013,36(3):30-34.
APA	Xie Chui-Yi,Jia Zhong-Tian,Qing Si-Han,Luo Shou-Shan,&Cheng Ming-Zhi.(2013).semi-random linear network coding for cloud storage redundancy.Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications,36(3),30-34.
MLA	Xie Chui-Yi,et al."semi-random linear network coding for cloud storage redundancy".Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications 36.3(2013):30-34.