本文選題：網(wǎng)絡(luò)編碼　切入點：分布式存儲　出處：《西南交通大學(xué)》2014年碩士論文

【摘要】：網(wǎng)絡(luò)編碼由R.Alswede于“Network Information Flow”一文中首次提出,它徹底改變了傳統(tǒng)路由的存儲轉(zhuǎn)發(fā)模式,允許中間節(jié)點對收到的數(shù)據(jù)包進(jìn)行信息重組,從而達(dá)到多播通信網(wǎng)絡(luò)的容量上界。Acedanski等人在“How good is random linear coding based distributed networked storage“一文中更是將網(wǎng)絡(luò)編碼的思想引入到存儲技術(shù)中,提出了一種隨機(jī)線性編碼方案。網(wǎng)絡(luò)編碼自提出以來就受到了各界學(xué)者的密切關(guān)注。 近年來,隨著互聯(lián)網(wǎng)的飛速發(fā)展,網(wǎng)絡(luò)信息量呈指數(shù)級的增長,信息技術(shù)產(chǎn)業(yè)已將其技術(shù)重心轉(zhuǎn)移至對存儲技術(shù)的研究。傳統(tǒng)的客戶機(jī)/服務(wù)器存儲模型已無法滿足人們?nèi)找嬖鲩L的存儲需求。分布式存儲主要利用網(wǎng)絡(luò)中閑置的存儲空間,通過網(wǎng)絡(luò)技術(shù)將網(wǎng)絡(luò)中的閑置PC機(jī)組合起來搭建成信息存儲資源池。因其良好的可擴(kuò)展性和低廉的價格得到了廣泛的運用。有人提出將網(wǎng)絡(luò)編碼技術(shù)運用于分布式存儲系統(tǒng)中。研究表明,將網(wǎng)絡(luò)編碼應(yīng)用于分布式存儲系統(tǒng)不僅能夠節(jié)約帶寬消耗,還能很好的實現(xiàn)負(fù)載均衡,增強(qiáng)系統(tǒng)的健壯性,對分布式存儲系統(tǒng)的發(fā)展和改進(jìn)意義重大。 本文首先對Acedanski等人提出的基于隨機(jī)線性編碼的存儲方案進(jìn)行了研究,對比了復(fù)制、糾刪碼等常見存儲方案,得出隨機(jī)線性編碼存儲方案能在消耗更少額外存儲帶寬的情況下以較高的概率完成源文件重構(gòu)的結(jié)論。接著,本文針對網(wǎng)絡(luò)編碼方案對分布式存儲系統(tǒng)下基于再生碼的節(jié)點修復(fù)技術(shù)進(jìn)行了研究。該修復(fù)技術(shù)最大的優(yōu)點在于無需下載整個源文件就可實現(xiàn)失效節(jié)點的修復(fù),能大大減少節(jié)點修復(fù)時的帶寬開銷。相關(guān)文獻(xiàn)證明了再生碼方案存在兩個極值點即：最小存儲帶寬再生點(Minimum storage regeneration points, MSR)和最小節(jié)點修復(fù)帶寬再生點(Minimum bandwidth regeneration points, MBR)。本文對其對應(yīng)的兩種編碼修復(fù)技術(shù)：最小存儲再生碼(Minimum storage regeneration code, MSRC)和最小帶寬再生碼(Minimum bandwidth regeneration code, MBRC)進(jìn)行了深入的研究。通過本文的數(shù)值計算結(jié)果表明基于MBRC的編碼修復(fù)技術(shù)能在節(jié)點修復(fù)時實現(xiàn)帶寬消耗的最小值。文章最后對基于網(wǎng)絡(luò)編碼的MBRC方案進(jìn)行了仿真實現(xiàn),基于VC++6.0平臺對MBRC方案的數(shù)據(jù)分布、數(shù)據(jù)重構(gòu)、失效節(jié)點修復(fù)幾個過程進(jìn)行了模擬仿真。利用仿真結(jié)果驗證了MBRC方案的有效性。
[Abstract]:Network coding is first proposed by R.Alswede in "Network Information Flow". It completely changes the traditional routing mode and allows intermediate nodes to reorganize data packets. Acedanski et al introduced the idea of network coding into storage technology in "How good is random linear coding based distributed networked storage". In this paper, a random linear coding scheme is proposed. Network coding has been paid close attention by scholars since it was put forward. In recent years, with the rapid development of the Internet, the amount of network information is increasing exponentially. The information technology industry has shifted its technology focus to the research of storage technology. The traditional client / server storage model can no longer meet the increasing demand for storage. Distributed storage mainly makes use of the idle storage space in the network. The idle PC in the network is combined to form a pool of information storage resources through network technology. Because of its good expansibility and low price, it has been widely used. Some people have proposed to apply network coding technology to distribution. Research shows that, The application of network coding in distributed storage system can not only save bandwidth consumption, but also achieve load balance and enhance the robustness of the system. It is of great significance to the development and improvement of distributed storage system. In this paper, the storage schemes based on random linear coding proposed by Acedanski et al are studied, and the common storage schemes such as replication, erasure code and erasure code are compared. It is concluded that the stochastic linear coding storage scheme can complete the reconstruction of source files with a higher probability of consuming less additional storage bandwidth. In this paper, the node repair technology based on regenerative code in distributed storage system is studied according to the network coding scheme. The biggest advantage of this repair technique is that the failure node can be repaired without downloading the whole source file. It is proved that there are two extremum points in the scheme: minimum storage regeneration points (MSRs) and minimum bandwidth regeneration points (MSRs). Two corresponding coding repair techniques, minimum memory storage regeneration code (MSRC) and minimum bandwidth regenerative code minimum bandwidth regeneration (MBRC), are studied in detail. The numerical results of this paper show that the MBRC based code repair technique is based on MBRC. The minimum bandwidth consumption can be realized when nodes are repaired. Finally, the MBRC scheme based on network coding is simulated. The data distribution, data reconfiguration and failure node repair of MBRC are simulated based on VC 6.0 platform, and the validity of MBRC scheme is verified by simulation results.
【學(xué)位授予單位】：西南交通大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TP333

【參考文獻(xiàn)】

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

1 郭春梅;畢學(xué)堯;;糾刪碼的分析與研究[J];信息安全與技術(shù);2010年07期

2 周靈;;Waxman-Salama模型網(wǎng)絡(luò)拓?fù)渖伤惴ㄔO(shè)計與實現(xiàn)[J];湖南理工學(xué)院學(xué)報(自然科學(xué)版);2008年02期

，

本文編號：1694630