本文選題：網(wǎng)絡(luò)存儲 + 數(shù)據(jù)冗余　； 參考：《武漢大學(xué)學(xué)報(工學(xué)版)》2015年02期

【摘要】：針對分布式存儲系統(tǒng)的數(shù)據(jù)可用性問題展開了深入的研究,提出了一種支持糾刪碼的冗余倍數(shù)估計算法,根據(jù)數(shù)據(jù)統(tǒng)計特征獲取單個數(shù)據(jù)塊最優(yōu)冗余方案;并基于該算法模型設(shè)計了一種適用于分布式存儲系統(tǒng)的數(shù)據(jù)冗余策略,旨在消耗最小的存儲開銷獲得最優(yōu)的數(shù)據(jù)可用性.在實現(xiàn)該數(shù)據(jù)冗余策略的過程中,為了優(yōu)化理論算法模型的工程可行性,提出了基于采樣計算中間經(jīng)驗參數(shù)的方法,有效地利用目標存儲數(shù)據(jù)的統(tǒng)計特征降低算法的計算復(fù)雜度.仿真實驗驗證了這種數(shù)據(jù)冗余策略的可行性和有效性.
[Abstract]:In this paper, the data availability of distributed storage system is studied deeply, and a redundancy multiple estimation algorithm supporting erasure codes is proposed, which can obtain the optimal redundancy scheme of a single data block according to the statistical characteristics of the data.Based on the algorithm model, a data redundancy strategy for distributed storage systems is designed, which aims to achieve optimal data availability with minimal storage overhead.In order to optimize the engineering feasibility of the theoretical algorithm model, a method based on sampling to calculate the intermediate empirical parameters is proposed in order to optimize the engineering feasibility of the data redundancy strategy.The computational complexity of the algorithm is reduced by using the statistical features of the data stored by the target effectively.Simulation results demonstrate the feasibility and effectiveness of the data redundancy strategy.
【作者單位】： 武漢大學(xué)電子信息學(xué)院;
【分類號】：TP333

【相似文獻】

相關(guān)期刊論文 前10條

1 何公明;張元濤;;面向數(shù)字媒體的高性能分布式存儲系統(tǒng)的研究與應(yīng)用[J];廣播電視信息;2009年10期

2 范劍波,郭建康;分布式存儲系統(tǒng)性能模型的建立與應(yīng)用[J];計算機工程與應(yīng)用;2001年13期

3 范劍波,徐利浩;分布式存儲系統(tǒng)可靠性的研究[J];計算機工程;2001年06期

4 吳英;謝廣軍;劉t，

本文編號：1764994