發(fā)布時間：2018-01-29 20:49

  本文關(guān)鍵詞： 結(jié)構(gòu)化P2P網(wǎng)絡(luò) 負(fù)載均衡 分層Chord覆蓋結(jié)構(gòu) 熱點(diǎn) 副本復(fù)制　出處：《重慶大學(xué)》2014年碩士論文　論文類型：學(xué)位論文

【摘要】：作為一種典型的分布式系統(tǒng)，P2P網(wǎng)絡(luò)的應(yīng)用越來越廣泛。結(jié)構(gòu)化P2P網(wǎng)絡(luò)基于一致性散列函數(shù)，提供節(jié)點(diǎn)、對象資源位置在覆蓋網(wǎng)中的位置映射，具有良好的查詢效率。但是，結(jié)構(gòu)化P2P網(wǎng)絡(luò)自身的特點(diǎn)、邏輯拓?fù)浣Y(jié)構(gòu)與物理拓?fù)浣Y(jié)構(gòu)的不一致性、節(jié)點(diǎn)的異構(gòu)性、查詢請求的不平衡性都可能導(dǎo)致節(jié)點(diǎn)的負(fù)載超過其處理能力，出現(xiàn)負(fù)載失衡問題，進(jìn)而可能導(dǎo)致單點(diǎn)失效、請求延遲、網(wǎng)絡(luò)擁塞等性能問題。 本文對國內(nèi)外現(xiàn)有結(jié)構(gòu)化P2P網(wǎng)絡(luò)負(fù)載均衡技術(shù)進(jìn)行全面的分析和研究。在深入分析結(jié)構(gòu)化P2P網(wǎng)絡(luò)負(fù)載失衡的原因后，針對現(xiàn)有均衡策略的不足，提出了基于超級節(jié)點(diǎn)的分層Chord覆蓋結(jié)構(gòu)。同時，，在分層Chord覆蓋結(jié)構(gòu)上，提出了一種針對查詢熱點(diǎn)的混合式動態(tài)負(fù)載均衡策略。在均衡策略中，對負(fù)載的轉(zhuǎn)移時機(jī)、熱點(diǎn)資源的預(yù)測、負(fù)載信息的采集、負(fù)載轉(zhuǎn)移的開銷等進(jìn)行了研究。首先，根據(jù)對象資源歷史訪問頻率，預(yù)測熱點(diǎn)資源；接著，針對未來可能熱點(diǎn)資源和熱點(diǎn)資源，設(shè)計基于區(qū)域超級節(jié)點(diǎn)的副本復(fù)制策略；然后，根據(jù)分層Chord覆蓋結(jié)構(gòu)的特點(diǎn)，設(shè)計基于區(qū)域（均衡域）的負(fù)載信息采集方案；最后，針對請求重載節(jié)點(diǎn)，考慮節(jié)點(diǎn)的負(fù)載狀態(tài)和穩(wěn)定性，研究并提出負(fù)載轉(zhuǎn)移算法。在熱點(diǎn)資源的預(yù)測機(jī)制中，考慮歷史數(shù)據(jù)的時效性，設(shè)計熱度貢獻(xiàn)權(quán)重和重置措施。結(jié)合分層Chord覆蓋網(wǎng)的結(jié)構(gòu)、路由定位的特點(diǎn)，制定合理的副本復(fù)制位置，副本數(shù)量方案。對于副本復(fù)制和轉(zhuǎn)移產(chǎn)生的副本，進(jìn)行維護(hù)和管理。 本文采用P2Psim對提出的混合式動態(tài)負(fù)載均衡策略進(jìn)行仿真實(shí)驗(yàn)。主要從網(wǎng)絡(luò)節(jié)點(diǎn)過載率，熱點(diǎn)資源平均響應(yīng)時間，熱點(diǎn)節(jié)點(diǎn)利用率等方面進(jìn)行評估。實(shí)驗(yàn)結(jié)果表明，本文提出的混合式動態(tài)負(fù)載均衡策略能夠有效控制網(wǎng)絡(luò)節(jié)點(diǎn)過載的發(fā)生概率，快速調(diào)整節(jié)點(diǎn)的過載狀態(tài)，并且可以將節(jié)點(diǎn)利用率維持在較為平均的水平。
[Abstract]:As a typical distributed system, P2P network is more and more widely used. Structured P2P network is based on consistent hash function to provide location mapping of nodes and object resources in overlay network. It has good query efficiency, but the characteristics of structured P2P network, the inconsistency between logical topology and physical topology, the heterogeneity of nodes. The imbalance of query requests may cause the load of nodes to exceed their processing capacity and lead to the problem of load imbalance, which may lead to single point failure, request delay, network congestion and other performance problems. This paper makes a comprehensive analysis and research on the existing structured P2P network load balancing technology at home and abroad. After deeply analyzing the causes of the structural P2P network load imbalance, aiming at the shortcomings of the existing balancing strategy. A hierarchical Chord coverage structure based on super nodes is proposed, and a hybrid dynamic load balancing strategy for query hotspots is proposed in the hierarchical Chord coverage structure. The timing of load transfer, the prediction of hot resources, the collection of load information and the overhead of load transfer are studied. Firstly, according to the historical access frequency of object resources, the hot resources are predicted. Then, a replica replication strategy based on regional super nodes is designed for possible hot resources and hot resources in the future. Then, according to the characteristics of layered Chord coverage structure, a load information collection scheme based on region (balanced domain) is designed. Finally, considering the load state and stability of the request overloaded node, the load transfer algorithm is studied and proposed. In the prediction mechanism of hot resource, the timeliness of historical data is considered. Design heat contribution weight and reset measures. Combined with the structure of layered Chord overlay network and the characteristics of routing location, make a reasonable replica location. Copy quantity scheme. Maintenance and management of copies produced by copy replication and transfer. In this paper, P2Psim is used to simulate the hybrid dynamic load balancing strategy, mainly from the network node overload rate, the average response time of hot resources. The experimental results show that the hybrid dynamic load balancing strategy proposed in this paper can effectively control the occurrence probability of network node overload and quickly adjust the overload status of nodes. And the node utilization can be maintained at a more average level.
【學(xué)位授予單位】：重慶大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TP393.02

【參考文獻(xiàn)】

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

1 韓麗;雷振明;劉芳;;一種基于DHT的對等網(wǎng)絡(luò)構(gòu)造方式[J];北京郵電大學(xué)學(xué)報;2007年01期

2 彭麗媛;劉杰;趙霞;許慶平;;結(jié)構(gòu)化P2P網(wǎng)絡(luò)Chord算法研究[J];北京工商大學(xué)學(xué)報(自然科學(xué)版);2008年02期

3 張莉;王天順;;結(jié)構(gòu)化P2P網(wǎng)絡(luò)中拓?fù)淦ヅ鋯栴}研究[J];電腦學(xué)習(xí);2010年02期

4 孟憲福;陳曉令;;結(jié)構(gòu)化P2P網(wǎng)絡(luò)熱點(diǎn)負(fù)載動態(tài)遷移策略[J];電子學(xué)報;2011年10期

5 彭利民;肖文俊;;動態(tài)結(jié)構(gòu)化P2P網(wǎng)絡(luò)的負(fù)載均衡方案[J];華南理工大學(xué)學(xué)報(自然科學(xué)版);2011年10期

6 李振宇;謝高崗;;基于DHT的P2P系統(tǒng)的負(fù)載均衡算法[J];計算機(jī)研究與發(fā)展;2006年09期

7 于婧;張建輝;汪斌強(qiáng);;異構(gòu)結(jié)構(gòu)化P2P網(wǎng)絡(luò)負(fù)載均衡方案[J];計算機(jī)科學(xué);2008年05期

8 陸垂偉;李之棠;林懷清;黃慶鳳;張冶江;;一種結(jié)構(gòu)化P2P網(wǎng)絡(luò)動態(tài)負(fù)載均衡算法的研究[J];計算機(jī)科學(xué);2009年11期

9 張宇翔;張宏科;;一種層次結(jié)構(gòu)化P2P網(wǎng)絡(luò)中的負(fù)載均衡方法[J];計算機(jī)學(xué)報;2010年09期

10 鄭斯日古楞;;一種新的結(jié)構(gòu)化對等網(wǎng)負(fù)載均衡算法[J];計算機(jī)仿真;2012年05期

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

1 張?zhí)?結(jié)構(gòu)化P2P網(wǎng)絡(luò)關(guān)鍵技術(shù)研究[D];電子科技大學(xué);2013年

本文編號：1474330