本文關(guān)鍵詞：分布式存儲(chǔ)中的資源索引技術(shù)研究　出處：《浙江大學(xué)》2013年碩士論文　論文類型：學(xué)位論文

  更多相關(guān)文章： 分布式存儲(chǔ) 倒排索引 信譽(yù) 負(fù)載均衡 資源索引 可擴(kuò)展性

【摘要】：互聯(lián)網(wǎng)的快速發(fā)展導(dǎo)致數(shù)據(jù)量的不斷膨脹,單一節(jié)點(diǎn)的存儲(chǔ)容量難以滿足海量數(shù)據(jù)存儲(chǔ)的要求,用戶對(duì)容量巨大、安全、高效、可靠的分布式存儲(chǔ)系統(tǒng)的需求也越來(lái)越大。傳統(tǒng)的分布式存儲(chǔ)系統(tǒng)通常部署在穩(wěn)定可靠的節(jié)點(diǎn)上,難以有效利用P2P網(wǎng)絡(luò)中大量的存儲(chǔ)空間和計(jì)算資源。如何利用這些空閑的存儲(chǔ)和計(jì)算資源以構(gòu)建大容量、高可用的存儲(chǔ)服務(wù)平臺(tái)是當(dāng)前分布式存儲(chǔ)領(lǐng)域的研究熱點(diǎn)。 本文分析了P2P網(wǎng)絡(luò)的特點(diǎn)以及當(dāng)前分布式存儲(chǔ)系統(tǒng)在資源檢索方面的特點(diǎn),提出并實(shí)現(xiàn)了一個(gè)基于信譽(yù)的倒排索引框架ROIN;根據(jù)DHT結(jié)構(gòu)的特點(diǎn),設(shè)計(jì)了一個(gè)基于分組和信譽(yù)的負(fù)載均衡分布式存儲(chǔ)與資源索引框架LBGR。 ROIN框架通過(guò)雙層DHT網(wǎng)絡(luò)進(jìn)行資源檢索,實(shí)現(xiàn)了關(guān)鍵字模糊搜索,克服了傳統(tǒng)DHT結(jié)構(gòu)的不足；針對(duì)P2P網(wǎng)絡(luò)中節(jié)點(diǎn)動(dòng)態(tài)性強(qiáng)的特點(diǎn),建立了節(jié)點(diǎn)信譽(yù)模型并計(jì)算節(jié)點(diǎn)的信譽(yù)值,在此基礎(chǔ)上選取高信譽(yù)值的節(jié)點(diǎn)作為索引節(jié)點(diǎn),從而避免了將索引信息存儲(chǔ)在不可靠節(jié)點(diǎn)上,提高了系統(tǒng)的可靠性。通過(guò)搜索覆蓋率、搜索延遲、索引節(jié)點(diǎn)負(fù)載和網(wǎng)絡(luò)擾動(dòng)等方面的實(shí)驗(yàn),以及一系列與GlusterFS、 Pastry、PCIR的對(duì)比實(shí)驗(yàn),證明了ROIN能夠在P2P網(wǎng)絡(luò)上建立一個(gè)健壯、有效的資源索引框架。 由于ROIN是分布式的資源索引框架,同樣存在數(shù)據(jù)一致性等普遍存在于分布式資源索引系統(tǒng)中的問(wèn)題,本文提出了一種新型的資源索引框架LBGR。LBGR采用了分組和信譽(yù)相結(jié)合的資源管理策略,實(shí)現(xiàn)了基于DHT結(jié)構(gòu)的資源索引技術(shù)。通過(guò)信譽(yù)系統(tǒng)的評(píng)估,LBGR框架選擇高信譽(yù)值的節(jié)點(diǎn)作為超級(jí)節(jié)點(diǎn)并對(duì)惡意節(jié)點(diǎn)進(jìn)行有效遏制；通過(guò)基于虛擬節(jié)點(diǎn)的負(fù)載均衡策略,解決了DHT系統(tǒng)中普遍存在的負(fù)載均衡問(wèn)題。模擬實(shí)驗(yàn)驗(yàn)證了所提出的負(fù)載均衡算法的有效性,其結(jié)果可與集中式負(fù)載均衡算法相比擬。通過(guò)與GlusterFS的比較分析,LBGR顯示了在應(yīng)對(duì)P2P網(wǎng)絡(luò)節(jié)點(diǎn)動(dòng)態(tài)性方面的優(yōu)勢(shì)。 上述兩種不同的資源索引框架均能運(yùn)行在P2P網(wǎng)絡(luò)上,各具優(yōu)勢(shì),并通過(guò)實(shí)驗(yàn)證明能提供可靠高效的服務(wù),具有實(shí)際應(yīng)用價(jià)值。
[Abstract]:The rapid development of the Internet leads to the continuous expansion of the data quantity , the storage capacity of a single node is difficult to meet the requirements of the mass data storage , and the requirement of the user to the distributed storage system with large capacity , safety , high efficiency and reliability is more and more large . Traditional distributed storage systems are usually deployed on a stable and reliable node , so that a large amount of storage space and computing resources in the P2P network are difficult to effectively utilize . This paper analyzes the characteristics of P2P network and the characteristics of current distributed storage system in resource retrieval , proposes and implements a reputation - based inverted index framework ROIN , designs a load balance distributed storage and resource index framework LBGR based on packet and reputation according to the characteristics of DHT structure . In order to overcome the disadvantages of traditional DHT structure , a node reputation model is established and the node ' s reputation value is calculated , and a series of experiments with GlusterFS , Pastry and PCIR prove that ROIN can set up a robust and effective resource index framework on P2P network . Because ROIN is a distributed resource index framework , there is also a problem that data consistency exists in distributed resource indexing system . In this paper , a new resource index framework LBGR.LBGR is proposed . A new resource index technology based on DHT is presented . Based on the evaluation of reputation system , the LBGR framework selects the node with high reputation value as the super node and effectively restrains the malicious node . The simulation experiment verifies the effectiveness of the proposed load balancing algorithm . The results can be compared with the centralized load balancing algorithm . By comparison with GlusterFS , LBGR shows the advantages of the P2P network node dynamics . the two different resource index frames can be operated on the P2P network , the advantages are advantageous , and a reliable and efficient service can be provided through experiments to have practical application value .

【學(xué)位授予單位】：浙江大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2013
【分類號(hào)】：TP333

【參考文獻(xiàn)】

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

1 賈兆慶;薛廣濤;唐新懷;張鵬翥;尤晉元;;非結(jié)構(gòu)化P2P中的一種信任機(jī)制[J];計(jì)算機(jī)研究與發(fā)展;2010年04期

2 楊磊;黃浩;李仁發(fā);李肯立;;一種基于分組管理的混合式P2P存儲(chǔ)系統(tǒng)[J];計(jì)算機(jī)科學(xué);2010年01期

3 劉玉枚;楊壽保;陳萬(wàn)明;郭磊濤;韋冬;;P2P系統(tǒng)中基于信譽(yù)感知的超級(jí)節(jié)點(diǎn)選擇算法研究[J];中國(guó)科學(xué)院研究生院學(xué)報(bào);2008年02期

，

本文編號(hào)：1421959