semi-random linear network coding for cloud storage redundancy

ISCAS OpenIR

	semi-random linear network coding for cloud storage redundancy
	Xie Chui-Yi; Jia Zhong-Tian; Qing Si-Han; Luo Shou-Shan; Cheng Ming-Zhi
	2013
发表期刊	Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications
ISSN	1007-5321
卷号	36 期号:3 页码:30-34
摘要	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
关键词	Algorithms Decoding Linear Networks Network Coding Redundancy Vectors
部门归属	(1) National Engineering Laboratory for Disaster Backup and Recovery Beijing University of Posts and Telecommunications Beijing 100876 China; (2) School of Mathematics and Information Science Shaoguan University Guangdong Shaoguan 512005 China; (3) Shandong Provincial Key Laboratory of Network Based Intelligent Computing Jinan 250022 China; (4) Institute of Software Chinese Academy of Sciences Beijing 100190 China; (5) Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China; (6) College of Information Engineering Beijing Institute of Graphic Communication Beijing 102600 China
语种	中文
内容类型	期刊论文
URI标识	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.