本文關(guān)鍵詞：基于DHT的存儲(chǔ)系統(tǒng)中糾刪碼技術(shù)研究　出處：《西安電子科技大學(xué)》2013年碩士論文　論文類型：學(xué)位論文

  更多相關(guān)文章： 分布式哈希表（DHT） 糾刪碼 柯西碼 可用性 數(shù)據(jù)更新

【摘要】：基于分布式哈希表（DHT）的云存儲(chǔ)系統(tǒng)有著良好的擴(kuò)展性和快速的數(shù)據(jù)存取能力�；贒HT的數(shù)據(jù)存儲(chǔ)系統(tǒng)具有動(dòng)態(tài)性和異構(gòu)性，導(dǎo)致數(shù)據(jù)隨時(shí)可能丟失。因此，如何保證DHT系統(tǒng)的高可用性成為研究DHT存儲(chǔ)系統(tǒng)的關(guān)鍵問題。 本文研究了基于DHT的云存儲(chǔ)系統(tǒng)的冗余機(jī)制和基于柯西矩陣的糾刪碼技術(shù)，并改進(jìn)了柯西編碼的編碼運(yùn)算和數(shù)據(jù)更新策略。本文的主要工作概括如下： 1.概述了分布式哈希表的設(shè)計(jì)原理和幾種常見DHT協(xié)議的基本原理，分析了傳統(tǒng)的副本和糾刪碼兩種數(shù)據(jù)冗余機(jī)制，闡述了運(yùn)用在DHT存儲(chǔ)系統(tǒng)中的RS糾刪碼的原理。 2.分析了基于柯西矩陣的RS糾刪碼的原理，根據(jù)柯西編碼過程中有限域運(yùn)算的特點(diǎn)給出了一種減少運(yùn)算過程中異或操作個(gè)數(shù)的算法。實(shí)驗(yàn)結(jié)果表明通過該方法有效地減少了運(yùn)算過程中異或操作的個(gè)數(shù)，從而相對(duì)傳統(tǒng)RS碼而言有著更優(yōu)的編碼性能。 3.仔細(xì)分析了現(xiàn)有的兩種數(shù)據(jù)更新策略，并給出了一種新的數(shù)據(jù)更新策略。通過將數(shù)據(jù)更新過程中的運(yùn)算分布到多個(gè)節(jié)點(diǎn)來減少更新過程中運(yùn)算時(shí)間，，有效地提高了數(shù)據(jù)更新的效率。仿真結(jié)果表明本文所給出的數(shù)據(jù)更新策略比傳統(tǒng)的更新策略有著更高的效率。
[Abstract]:The cloud storage system based on distributed hash table (DHT) has good expansibility and fast data access ability. The data storage system based on DHT is dynamic and heterogeneous. Therefore, how to ensure the high availability of DHT system becomes a key problem in the study of DHT storage system. This paper studies the redundancy mechanism of cloud storage system based on DHT and erasure code technology based on Cauchy matrix, and improves the coding operation and data updating strategy of Cauchy coding. The main work of this paper is summarized as follows:. 1. The design principle of distributed hash table and the basic principles of several common DHT protocols are summarized, and two kinds of data redundancy mechanisms, traditional replica and erasure code, are analyzed. The principle of RS erasure code used in DHT storage system is described. 2. The principle of RS erasure code based on Cauchy matrix is analyzed. According to the characteristics of the finite field operation in the Cauchy coding process, an algorithm is proposed to reduce the number of XOR operations in the operation process. The experimental results show that this method can effectively reduce the number of XOR operations in the operation process. Compared with the traditional RS code, it has better coding performance. 3. Two existing data update strategies are analyzed carefully, and a new data update strategy is proposed. The operation time is reduced by distributing the operation in the process of data updating to multiple nodes. The simulation results show that the data update strategy presented in this paper is more efficient than the traditional updating strategy.
【學(xué)位授予單位】：西安電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2013
【分類號(hào)】：TP333;TN911.2

【參考文獻(xiàn)】

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

1 吳吉義;平玲娣;潘雪增;李卓;;云計(jì)算:從概念到平臺(tái)[J];電信科學(xué);2009年12期

2 吳吉義;傅建慶;張明西;平玲娣;;云數(shù)據(jù)管理研究綜述[J];電信科學(xué);2010年05期

3 陳貴海;吳帆;李宏興;邱彤慶;;基于DHT的P2P系統(tǒng)中高可用數(shù)據(jù)冗余機(jī)制[J];計(jì)算機(jī)學(xué)報(bào);2008年10期

4 田敬;代亞非;;P2P持久存儲(chǔ)研究[J];軟件學(xué)報(bào);2007年06期

相關(guān)博士學(xué)位論文 前1條

1 田敬;對(duì)等存儲(chǔ)系統(tǒng)中的數(shù)據(jù)可用性與安全性研究[D];北京大學(xué);2007年

本文編號(hào)：1373236