本文選題：IPv6網(wǎng)絡(luò)數(shù)據(jù)流 + 負(fù)載均衡�。� 參考：《哈爾濱工程大學(xué)》2014年碩士論文

【摘要】：隨著互聯(lián)網(wǎng)應(yīng)用技術(shù)的不斷進(jìn)步,以及規(guī)模的不斷擴(kuò)大,如何保障網(wǎng)絡(luò)信息的安全性已成為新一代互聯(lián)網(wǎng)急需解決的重要問題�；诓⑿蟹治龅姆阑饓�、入侵防護(hù)系統(tǒng)和流量檢測(cè)系統(tǒng)等網(wǎng)絡(luò)安全系統(tǒng)已成為解決網(wǎng)絡(luò)安全問題的有效手段。在這些安全系統(tǒng)中如何保證網(wǎng)絡(luò)數(shù)據(jù)流的負(fù)載均衡是這些系統(tǒng)中最先要解決的問題,而這就需要對(duì)系統(tǒng)接收到達(dá)的數(shù)據(jù)包報(bào)文進(jìn)行快速、實(shí)時(shí)的流分類。目前,針對(duì)IPv4網(wǎng)絡(luò)數(shù)據(jù)流國內(nèi)外已經(jīng)提出較完善的解決方案,針對(duì)新一代IPv6網(wǎng)絡(luò)數(shù)據(jù)流的負(fù)載均衡并沒有決定性的解決方案。本文在研究已有相關(guān)技術(shù)的基礎(chǔ)上從以下幾個(gè)方面解決IPv6網(wǎng)絡(luò)數(shù)據(jù)流并行分析負(fù)載均衡問題:首先,考慮到數(shù)據(jù)流的靜態(tài)負(fù)載均衡,本文提出了一種面向IPv6數(shù)據(jù)流并行分析的哈希算法。該算法在分析以往傳統(tǒng)哈希算法的前提下主要捕捉在真實(shí)的IPv6地址中每一個(gè)比特位的變化頻率,并根據(jù)該特征提出基于位熵的哈希算法。通過在不同的哈�？臻g下對(duì)該算法進(jìn)行客觀評(píng)價(jià),以及與若干傳統(tǒng)哈希算法的對(duì)比實(shí)驗(yàn)證明該算法的優(yōu)越性與合理性。其次,考慮到數(shù)據(jù)流的動(dòng)態(tài)負(fù)載均衡,本文提出了并行分析中負(fù)載均衡的評(píng)價(jià)標(biāo)準(zhǔn),以及一種面向數(shù)據(jù)流的自適應(yīng)動(dòng)態(tài)負(fù)載均衡模型。這里討論的負(fù)載均衡應(yīng)用對(duì)象為由多核處理器搭建的網(wǎng)絡(luò)數(shù)據(jù)流檢測(cè)系統(tǒng)。在系統(tǒng)中可以把每個(gè)處理器看做網(wǎng)絡(luò)數(shù)據(jù)流檢測(cè)引擎,且每組檢測(cè)引擎的責(zé)任完全相同。在充分考慮到已有的動(dòng)態(tài)負(fù)載均衡模型的前提下,本文提出的模型首先對(duì)數(shù)據(jù)包調(diào)用靜態(tài)哈希算法,從而避免同一個(gè)數(shù)據(jù)流被分到不同的檢測(cè)引擎;然后維護(hù)若干狀態(tài)表,保證模型對(duì)系統(tǒng)內(nèi)各個(gè)節(jié)點(diǎn)的負(fù)載信息進(jìn)行實(shí)時(shí)地監(jiān)控。利用本文提出的自適應(yīng)動(dòng)態(tài)負(fù)載均衡模型可以及時(shí)將數(shù)據(jù)流分配到負(fù)載較輕的檢測(cè)引擎中,從而達(dá)到網(wǎng)絡(luò)數(shù)據(jù)流負(fù)載均衡的目的。為了驗(yàn)證本實(shí)驗(yàn)所采用的自適應(yīng)負(fù)載均衡模型的優(yōu)越性,在系統(tǒng)加載自適應(yīng)負(fù)載均衡模塊之前和之后分別統(tǒng)計(jì)每個(gè)檢測(cè)引擎的負(fù)載因子隨時(shí)間變化的趨勢(shì),并通過并行分析中負(fù)載均衡的評(píng)價(jià)標(biāo)準(zhǔn),證明模型的優(yōu)越性與合理性。
[Abstract]:With the continuous progress of Internet application technology and the continuous expansion of the scale, how to ensure the security of network information has become an important problem urgently needed to be solved by the new generation of Internet. Network security systems, such as firewall, intrusion protection system and traffic detection system based on parallel analysis, have become an effective means to solve network security problems. In these security systems, how to ensure the load balance of network data flow is the first problem to be solved in these systems, and it is necessary to classify the incoming packets quickly and in real time. At present, more perfect solutions have been put forward for the IPv4 network data flow at home and abroad, but there is no decisive solution for the new generation of IPv6 network data flow load balancing. Based on the research of existing technologies, this paper solves the load balancing problem of IPv6 network data stream in the following aspects: firstly, considering the static load balancing of data flow, This paper presents a hash algorithm for parallel analysis of IPv6 data streams. On the premise of analyzing the traditional hash algorithms, the algorithm mainly captures the change frequency of each bit in the real IPv6 address, and proposes a hash algorithm based on potential entropy according to this feature. The advantages and reasonableness of the algorithm are proved by the objective evaluation in different hash spaces and the comparison with some traditional hash algorithms. Secondly, considering the dynamic load balancing of data flow, this paper proposes an evaluation standard for load balancing in parallel analysis and an adaptive dynamic load balancing model for data flow. The load balancing application object discussed here is a network data flow detection system based on multi-core processor. In the system, each processor can be regarded as a network data flow detection engine, and each set of detection engines have the same responsibility. Taking fully into account the existing dynamic load balancing model, the model proposed in this paper first calls static hash algorithm to the data packet, so as to avoid the same data stream being divided into different detection engines, and then maintains a number of state tables. Ensure that the model can monitor the load information of each node in the system in real time. By using the adaptive dynamic load balancing model proposed in this paper, the data flow can be allocated to the lighter load detection engine in time, thus achieving the purpose of load balancing of network data flow. In order to verify the superiority of the adaptive load balancing model used in this experiment, before and after the system loading the adaptive load balancing module, the trends of the load factors of each detection engine with time were counted respectively. The superiority and rationality of the model are proved by the evaluation standard of load balance in parallel analysis.
【學(xué)位授予單位】：哈爾濱工程大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP393.08

【參考文獻(xiàn)】

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

1 王瑞青;杜慧敏;王亞剛;;基于Hash和CAM的IPv6路由查找算法[J];計(jì)算機(jī)工程;2012年08期

2 李彥君;鐘求喜;陳誠;陸華彪;;多核平臺(tái)入侵檢測(cè)系統(tǒng)負(fù)載均衡算法設(shè)計(jì)與實(shí)現(xiàn)[J];計(jì)算機(jī)應(yīng)用研究;2012年04期

3 劉許剛;馬宏;;IP流檢測(cè)中基于信息熵的哈希算法改進(jìn)[J];計(jì)算機(jī)工程;2011年16期

4 余穎;楊頻;梁剛;;并行入侵檢測(cè)系統(tǒng)的預(yù)測(cè)負(fù)載均衡方法[J];計(jì)算機(jī)工程與設(shè)計(jì);2011年08期

5 高興旺;王瓊;歐陽一鳴;;基于混合預(yù)測(cè)模型的負(fù)載均衡算法研究[J];計(jì)算機(jī)工程與設(shè)計(jì);2010年16期

6 趙國峰;閆亮;;用于快速流分類的關(guān)鍵字分解Hash算法[J];計(jì)算機(jī)工程;2010年16期

7 伍海波;陶滔;唐啟濤;陳虹;;基于負(fù)載均衡的并行入侵檢測(cè)系統(tǒng)設(shè)計(jì)[J];微計(jì)算機(jī)信息;2009年12期

8 陳一驕;盧錫城;時(shí)向泉;孫志剛;;一種面向會(huì)話的自適應(yīng)負(fù)載均衡算法[J];軟件學(xué)報(bào);2008年07期

9 陳一驕;盧錫城;孫志剛;;面向流管理的哈希算法研究[J];計(jì)算機(jī)工程與科學(xué);2008年04期

10 潘喬;裴昌幸;;用于高速IPv6網(wǎng)絡(luò)流量抽樣測(cè)量的算法[J];西安電子科技大學(xué)學(xué)報(bào);2007年03期

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

1 陳一驕;網(wǎng)絡(luò)入侵檢測(cè)系統(tǒng)高速處理技術(shù)研究[D];國防科學(xué)技術(shù)大學(xué);2007年

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

1 溫明成;基于高速網(wǎng)絡(luò)系統(tǒng)的負(fù)載均衡算法研究[D];電子科技大學(xué);2012年

2 魯麗美;基于降維的IPv6包分類算法的設(shè)計(jì)與實(shí)現(xiàn)[D];北京郵電大學(xué);2010年

3 于洪偉;基于多核處理器高效入侵檢測(cè)技術(shù)研究與實(shí)現(xiàn)[D];電子科技大學(xué);2009年

，

本文編號(hào)：1853814