本文選題：P2P網(wǎng)絡(luò) + 分布式存儲(chǔ)��； 參考：《湖南理工學(xué)院》2017年碩士論文

【摘要】：針對傳統(tǒng)集中式存儲(chǔ)技術(shù)存在容量小、可擴(kuò)展性差、成本高等問題,論文提出一種基于P2P網(wǎng)絡(luò)的分布式存儲(chǔ)系統(tǒng),并給出系統(tǒng)的分布式實(shí)現(xiàn)策略。系統(tǒng)通過P2P技術(shù)將互聯(lián)網(wǎng)上分散的計(jì)算機(jī)進(jìn)行連接,并對這些計(jì)算機(jī)上的閑散資料進(jìn)行整合,形成一個(gè)廉價(jià)、可擴(kuò)展、高性能以及高可靠的分布式系統(tǒng)。論文圍繞分布式存儲(chǔ)系統(tǒng)中的關(guān)鍵技術(shù)展開研究,主要研究工作如下:1.提出了一種改進(jìn)的Chord路由算法。針對原始Chord路由中存在冗余信息以及查尋效率不高問題,提出一種改進(jìn)的Chord路由算法,利用對立節(jié)點(diǎn)建立順時(shí)針與逆時(shí)針兩個(gè)路由表,實(shí)現(xiàn)了雙向查尋,同時(shí)改進(jìn)了路由表構(gòu)造方法,減少了冗余表項(xiàng),理論分析與仿真實(shí)驗(yàn)表明,該算法降低了查詢的平均路徑長度,提高了查尋效率。2.提出了一種基于信息二叉樹的副本一致性維護(hù)算法(RBT)。RBT采用Chord協(xié)議管理副本節(jié)點(diǎn),利用路由表構(gòu)造信息二叉樹,把文件副本保存在二叉樹上,可避免單點(diǎn)失效。通過這種信息生成樹可以使副本更新信息快速地傳到底層網(wǎng)絡(luò),實(shí)驗(yàn)證明該算法可降低網(wǎng)絡(luò)時(shí)延,減少網(wǎng)絡(luò)維護(hù)開銷,提高系統(tǒng)的可靠性。3.設(shè)計(jì)了一個(gè)基于P2P網(wǎng)絡(luò)的分布式存儲(chǔ)與資源查找原型系統(tǒng),實(shí)現(xiàn)了信息檢索與副本管理功能,驗(yàn)證了本文的理論研究。
[Abstract]:Aiming at the problems of low capacity, poor expansibility and high cost in traditional centralized storage technology, a distributed storage system based on P2P network is proposed, and the distributed implementation strategy of the system is given. The system connects distributed computers on the Internet through P2P technology, and integrates the idle data on these computers to form a cheap, scalable, high performance and high reliable distributed system. This paper focuses on the key technologies of distributed storage system, the main research work is as follows: 1. An improved Chord routing algorithm is proposed. Aiming at the problems of redundant information and low searching efficiency in the original Chord routing, an improved Chord routing algorithm is proposed. Two routing tables, clockwise and counterclockwise, are established by using the opposing nodes to realize two-way search. At the same time, the routing table construction method is improved, and the redundant table items are reduced. The theoretical analysis and simulation results show that the algorithm reduces the average path length of the query and improves the search efficiency. 2. This paper presents a replica consistency maintenance algorithm based on information binary tree, which uses Chord protocol to manage replica nodes, constructs information binary tree by routing table, and saves file replica on binary tree, which can avoid single point failure. Through this information generation tree, the replica update information can be quickly transmitted to the underlying network. Experiments show that the algorithm can reduce the network delay, reduce the network maintenance overhead, and improve the reliability of the system. A prototype system of distributed storage and resource search based on P2P network is designed. The functions of information retrieval and replica management are realized, and the theoretical research of this paper is verified.
【學(xué)位授予單位】：湖南理工學(xué)院
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TP393.0;TP333

【參考文獻(xiàn)】

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

1 歐陽竟成;彭鄧華;彭鑫;;Chord路由算法的改進(jìn)與研究[J];湖南理工學(xué)院學(xué)報(bào)(自然科學(xué)版);2017年01期

2 王峰;李立新;曹景源;潘聰;;發(fā)布/訂閱系統(tǒng)中的緩存副本一致性研究[J];計(jì)算機(jī)應(yīng)用;2016年06期

3 王挺;吳曉軍;張玉梅;;基于遺傳算法的雙向搜索Chord算法[J];計(jì)算機(jī)應(yīng)用研究;2016年01期

4 席屏;薛峰;;多層一致性哈希的HDFS副本放置策略[J];計(jì)算機(jī)系統(tǒng)應(yīng)用;2015年02期

5 孫新;李慶洲;趙璞;王克祥;潘凡;;對等網(wǎng)絡(luò)中一種優(yōu)化的副本分布方法[J];計(jì)算機(jī)學(xué)報(bào);2014年06期

6 王慧;王錚;;基于新路由表的雙向搜索chord路由算法[J];計(jì)算機(jī)工程與應(yīng)用;2014年23期

7 張明軍;彭婭;俞文靜;;P2P流媒體服務(wù)方案及其關(guān)鍵技術(shù)研究[J];計(jì)算機(jī)工程;2013年01期

8 祁玉;張新有;;chord路由表結(jié)構(gòu)的分析與改進(jìn)[J];計(jì)算機(jī)工程與設(shè)計(jì);2010年06期

9 王禹;趙躍龍;侯f ;;P2P存儲(chǔ)系統(tǒng)副本一致性維護(hù)策略[J];計(jì)算機(jī)工程;2010年01期

10 周偉平;劉衛(wèi)國;;基于節(jié)點(diǎn)異構(gòu)的雙向查詢Chord系統(tǒng)[J];計(jì)算機(jī)工程;2009年02期

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

1 林文毅;P2P分布式存儲(chǔ)系統(tǒng)相關(guān)技術(shù)研究[D];西安電子科技大學(xué);2009年

，

本文編號：1988703