本文關(guān)鍵詞： P2P數(shù)據(jù)集成 DHT Kademlia網(wǎng)絡(luò) 快表　出處：《山東大學(xué)》2014年碩士論文　論文類型：學(xué)位論文

【摘要】：P2P技術(shù)的誕生給數(shù)據(jù)集成領(lǐng)域帶來了強大的發(fā)展動力。傳統(tǒng)的集中式數(shù)據(jù)集成系統(tǒng)具有系統(tǒng)性能依賴服務(wù)器這一系統(tǒng)短板,結(jié)合P2P和數(shù)據(jù)集成系統(tǒng)兩者優(yōu)勢而誕生的P2P數(shù)據(jù)集成系統(tǒng),能夠克服傳統(tǒng)集中式數(shù)據(jù)集成系統(tǒng)的這一缺陷,為用戶提供高速精確的數(shù)據(jù)查詢服務(wù)。 在眾多的基于DHT的P2P網(wǎng)絡(luò)中,Kademlia網(wǎng)絡(luò)作為一種比較成熟且比較高效的協(xié)議,得到了廣泛的應(yīng)用。它的邏輯結(jié)構(gòu)類似數(shù)據(jù)結(jié)構(gòu)中的二叉樹,清晰而明了,每個節(jié)點根據(jù)DHT分配一個獨一無二的節(jié)點ID,對于計算節(jié)點之間的距離,Kademlia網(wǎng)絡(luò)采用的獨特的XOR計算方式。通過這種方式,對于資源關(guān)鍵字,它定位的時間復(fù)雜度是θ(logn)。但是Kademlia網(wǎng)絡(luò)并不是完美無缺的,在本文中我們著重要解決的問題包括：Kademlia網(wǎng)絡(luò)的邏輯拓?fù)浜臀锢硗負(fù)洳黄ヅ涞膯栴},如何最大限度的減少熱點資源對網(wǎng)絡(luò)本身帶來的沖擊,如何在原有的基礎(chǔ)之上進一步提高資源定位的速度和精確度。對于這些問題的深入研究和解決,成為了本文的主要內(nèi)容。 為了解決這些問題,在本文中,我們對網(wǎng)絡(luò)中的節(jié)點ID進行了一系列修改,將節(jié)點的IP地址的網(wǎng)絡(luò)號加入到了節(jié)點的ID之中,通過Kademlia特有的計算節(jié)點距離的方式,可以使得網(wǎng)絡(luò)在物理拓?fù)渖吓c邏輯拓?fù)湎嗥ヅ�。針對我們改進的模型,我們提出在原有的節(jié)點基礎(chǔ)之上增加超級節(jié)點的概念,超級節(jié)點負(fù)責(zé)管理本局域網(wǎng)的節(jié)點并且擔(dān)負(fù)路由調(diào)控功能。針對熱點資源,我們在節(jié)點的結(jié)構(gòu)中增加了快表來緩解對網(wǎng)絡(luò)的沖擊。 首先,對節(jié)點的ID結(jié)構(gòu)進行了改進,將節(jié)點IP地址的網(wǎng)絡(luò)號作為ID的高位部分,結(jié)合Kademlia固有的XOR計算方式,使得在物理上靠近的節(jié)點在邏輯上也處于相近的位置。 其次,針對改進后網(wǎng)絡(luò)的邏輯拓?fù)浣Y(jié)構(gòu),為了能夠進一步提高資源查詢的速度和精度,我們提出在原有的基礎(chǔ)上增加超級節(jié)點的概念,超級節(jié)點只在本LAN中發(fā)揮作用,負(fù)責(zé)掌握本LAN的結(jié)構(gòu)和其中節(jié)點的信息,在路由轉(zhuǎn)發(fā)過程中超級節(jié)點負(fù)責(zé)本LAN的路由調(diào)控職責(zé)。超級節(jié)點機制和改進的節(jié)點ID互相配合,充分調(diào)用了網(wǎng)絡(luò)中的計算機資源,并且在很大程度上提高了資源定位的速度。 最后,針對P2P網(wǎng)絡(luò)中經(jīng)常出現(xiàn)的熱點資源現(xiàn)象,我們在節(jié)點的結(jié)構(gòu)中加入了新設(shè)計的快表,用快表來記錄熱點資源的信息。在快表的幫助之下,一方面提高了節(jié)點對熱點資源的查詢訪問速度,另一方面也降低了短時間內(nèi)對熱點資源的海量訪問所帶來的對網(wǎng)絡(luò)的沖擊,可謂一舉兩得。
[Abstract]:The emergence of P2P technology has brought a powerful impetus to the data integration field. Traditional centralized data integration system has the system performance dependent server, which is a short board of the system. P2P data integration system, which combines the advantages of P2P and data integration system, can overcome the shortcoming of traditional centralized data integration system and provide users with high-speed and accurate data query service. Among many P2P networks based on DHT, Kademlia network is a mature and efficient protocol. Its logical structure is similar to the binary tree in the data structure. Each node is assigned a unique node IDD according to DHT to calculate the distance between nodes. Kademlia network uses a unique XOR computing method. In this way, for resource keywords. The time complexity of the location is 胃 gng, but the Kademlia network is not perfect. In this paper, the important problems we solve include the mismatch between the logical topology and physical topology of the: Kademlia network, and how to minimize the impact of hot resources on the network itself. How to further improve the speed and accuracy of resource location on the basis of the original is the main content of this paper. In order to solve these problems, in this paper, we made a series of changes to the node ID in the network, adding the network number of the node's IP address to the node ID. The network can match the logical topology in physical topology through the unique way of computing node distance in Kademlia. We put forward the concept of adding super nodes to the original nodes. The super nodes are responsible for managing the nodes of the local area network and the routing control function. We have added fast tables to the node structure to mitigate the impact on the network. First of all, the structure of node ID is improved. The network number of node IP address is taken as the high part of ID, and the inherent XOR calculation method of Kademlia is combined. The nodes that are physically close are logically close to each other. Secondly, in order to further improve the speed and accuracy of resource query, we propose the concept of adding super nodes to the improved logical topology of the network. Super nodes only play a role in this LAN and are responsible for mastering the structure of this LAN and the information about the nodes therein. In the process of routing forwarding, the super node is responsible for the LAN routing regulation and control. The super node mechanism and the improved node ID cooperate with each other, which make full use of the computer resources in the network. And to a large extent improve the speed of resource positioning. Finally, in view of the phenomenon of hot resource in P2P network, we add the newly designed fast table to the structure of the node and record the information of the hot resource with the help of the fast table. On the one hand, it improves the query access speed of nodes to hot resources, on the other hand, it also reduces the impact on the network caused by massive access to hot resources in a short time, so it can be said that killing two birds with one stone.
【學(xué)位授予單位】：山東大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TP393.02

【參考文獻】

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

1 王小鑒;;SQL參數(shù)化查詢詳解[J];電腦編程技巧與維護;2011年01期

2 郭仁東;;淺析計算機網(wǎng)絡(luò)的拓?fù)浣Y(jié)構(gòu)及其應(yīng)用[J];電腦知識與技術(shù);2012年31期

3 楊雪梅;董逸生;王永利;錢江波;錢剛;;異構(gòu)數(shù)據(jù)源集成中的模式映射技術(shù)[J];計算機科學(xué);2006年07期

4 謝瑾;倪瑾;;Kademlia的研究與實現(xiàn)[J];計算機時代;2009年10期

5 胡放明,李俊兵,賀貴明,丁健;對P2P網(wǎng)中發(fā)現(xiàn)機制的研究[J];計算機應(yīng)用;2004年06期

6 白洛,王元珍;基于訪問模式的數(shù)據(jù)庫緩沖管理自適應(yīng)研究[J];計算機應(yīng)用;2005年12期

7 張昊;戴長華;張，

本文編號：1491826