摘要
阐述了在网络存储系统中基于XOR的纠删编码的一种新方法,解决了传统RAID系统不能解决的高容错性问题,且比Reed-Solomon等算法有更好的时间效率。Ningxy编码方法对于解决高容错性问题有着最佳的效果,该编码更适用于动态增减磁盘数量的网络存储的数据修复;与此同时提出了新概念步长,步长对解决高度容错起到了关键性作用;通过线性变换、高斯消元,迅速地恢复丢失的磁盘数据。更值得一提的是从整体性能和效率上来说,该编码比其他的编码更具有灵活性。
This paper presented a new erasure coding scheme based on XOR in network storage system. The scheme solved high fault-tolerance but RAID system couldn＇ t, and it had much better time efficiency than Reed-Solomon algorithm. However Ningxy was best optimal for high fault-tolerance. The coding scheme was more applicable to data restoration in network storage that total numbers of disks was dynamic changed, besides introduced a novel concept step . The step played a key role in solving problem of high fault-tolerance and it was able to availably organize data. The lost disk data was rapidly restored by linear changes and Gaussian elimination. Noteworthily the coding was more flexible than other codes in whole performance and efficiency.
出处
《计算机应用研究》
CSCD
北大核心
2007年第12期41-43,53,共4页
Application Research of Computers
基金
国家自然科学基金资助项目(60403043)
