本文關(guān)鍵詞： P2P存儲 分層策略 冗余策略 JXTA　出處：《華中科技大學(xué)》2012年碩士論文　論文類型：學(xué)位論文

【摘要】：P2P存儲系統(tǒng)以P2P網(wǎng)絡(luò)為底層架構(gòu)基礎(chǔ)，充分利用P2P網(wǎng)絡(luò)的優(yōu)勢對節(jié)點進行組織，從而可以較好的利用節(jié)點的空閑計算能力和網(wǎng)絡(luò)帶寬資源，使得P2P存儲系統(tǒng)具有高可用性、高數(shù)據(jù)吞吐率、高擴展性等優(yōu)勢。相比以往P2P存儲系統(tǒng)，提出考慮節(jié)點間性能的差異以及這種差異對P2P存儲系統(tǒng)的影響，不再從整體上對節(jié)點進行統(tǒng)一的組織；同時，研究不同節(jié)點層次上最適合的冗余策略以提供最優(yōu)的節(jié)點可用性。 在節(jié)點組織方面，提出層次化組織的概念，通過在線向量粒度的刻畫P2P網(wǎng)絡(luò)節(jié)點的動態(tài)性，在此基礎(chǔ)上提出節(jié)點相似度的概念來衡量節(jié)點在線相似情況，以此來選取最適合某一節(jié)點數(shù)據(jù)存儲請求的最佳的存儲節(jié)點集合。在層次化組織節(jié)點的基礎(chǔ)上，動態(tài)的考慮不同節(jié)點層次上最佳的冗余策略，即不再為P2P存儲系統(tǒng)提供統(tǒng)一的冗余策略，，轉(zhuǎn)而根據(jù)此節(jié)點層次的可用性特征來動態(tài)的選取冗余策略。同時，提出了副本糾刪碼相融合和二次糾刪碼的冗余策略，并進行了其所能提供的數(shù)據(jù)可用性的初步分析。 設(shè)計實現(xiàn)了一個基于JXTA的P2P存儲系統(tǒng)，以其為實驗平臺驗證了P2P存儲系統(tǒng)中分層策略的優(yōu)勢，對比了副本與糾刪碼模式在不同節(jié)點層次上所能提供的系統(tǒng)可用性從而驗證了根據(jù)節(jié)點層次的不同動態(tài)的選取冗余策略的有效性。
[Abstract]:P2P storage system is based on P2P network, which makes full use of the advantages of P2P network to organize nodes, so as to make good use of the idle computing power of nodes and network bandwidth resources. P2P storage system has high availability, high data throughput, high scalability and other advantages. Compared with the previous P2P storage system. Considering the difference of performance between nodes and the influence of the difference on P2P storage system, the organization of nodes is not unified on the whole. At the same time, the optimal redundancy strategy at different node levels is studied to provide optimal node availability. In the aspect of node organization, the concept of hierarchical organization is put forward, and the dynamic characteristics of P2P network nodes are described by on-line vector granularity. On this basis, the concept of node similarity is proposed to measure the online similarity of nodes. In order to select the best set of storage nodes which is most suitable for a node data storage request. On the basis of hierarchical organization of nodes, dynamically consider the best redundancy strategy at different node levels. That is not to provide a unified redundancy policy for P2P storage system, but to dynamically select redundant strategy according to the usability characteristics of this node level. At the same time. A redundancy strategy of duplicate erasure code fusion and quadratic erasure code is proposed and the availability of data provided by it is analyzed preliminarily. A P2P storage system based on JXTA is designed and implemented, which is used as an experimental platform to verify the advantage of layered strategy in P2P storage system. The system availability of replica and erasure code at different node levels is compared to verify the effectiveness of selecting redundancy policies according to different dynamic nodes.
【學(xué)位授予單位】：華中科技大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2012
【分類號】：TP333;TP393.02

【參考文獻】

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

1 董芳,費新元,肖敏;基于CFS的P2P文件共享系統(tǒng)的研究[J];計算機工程與應(yīng)用;2004年04期

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

3 王宇,張建偉,盧昱;構(gòu)建安全的分布式網(wǎng)絡(luò)存儲系統(tǒng)[J];計算機應(yīng)用與軟件;2004年10期

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

本文編號：1484713