适用于云存储冗余的半随机线性网络编码

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

	适用于云存储冗余的半随机线性网络编码
	谢垂益 ; 贾忠田 ; 卿斯汉 ; 罗守山 ; 程明智
刊名	北京邮电大学学报
	2013
卷号	36 期号:3 页码:30-34
关键词	云存储网络编码单位向量冗余每字符运算次数
ISSN号	1007-5321
其他题名	Semi-Random Linear Network Coding for Cloud Storage Redundancy
中文摘要	为了实现数据冗余备份,根据云存储的结构特点和可用性要求,提出半随机线性网络编码(SRLNC)算法,使用有限域GF(2~s)上的单位行向量和随机行向量组成编码矩阵,对数据块分片、编码后进行冗余存储,采取单位行向量优先的策略进行解码. 分析了该算法的解码方程组存在唯一解的概率,并提出衡量算法运算时间的"每字符运算次数"指标. 实验结果表明,新算法在解码过程的运算时间随结点可用性的增加以指数级减少,当冗余度≤3且结点的可用性≥0.8时,比随机线性网络编码算法的编码运算时间快33%以上,比解码运算时间快5倍以上,适合应用于"一次写多次读"的云存储系统.
英文摘要	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≤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 "write once read many" cloud storage system.
收录类别	CSCD
语种	中文
CSCD记录号	CSCD:4899267
公开日期	2014-12-16
内容类型	期刊论文
源URL	[http://ir.iscas.ac.cn/handle/311060/16865]
专题	软件研究所_软件所图书馆_期刊论文
推荐引用方式 GB/T 7714	谢垂益,贾忠田,卿斯汉,等. 适用于云存储冗余的半随机线性网络编码[J]. 北京邮电大学学报,2013,36(3):30-34.
APA	谢垂益,贾忠田,卿斯汉,罗守山,&程明智.(2013).适用于云存储冗余的半随机线性网络编码.北京邮电大学学报,36(3),30-34.
MLA	谢垂益,et al."适用于云存储冗余的半随机线性网络编码".北京邮电大学学报 36.3(2013):30-34.