發(fā)布時間：2018-06-08 18:22

  本文選題：異常入侵數(shù)據(jù)干擾 + 網(wǎng)絡資源��； 參考：《計算機仿真》2017年03期

【摘要】：對異常入侵數(shù)據(jù)干擾下對網(wǎng)絡資源進行合理的調度,可提高網(wǎng)絡資源的可利用率。進行資源調度時,應獲取異常入侵數(shù)據(jù)干擾下網(wǎng)絡資源調度過程中資源的動態(tài)優(yōu)先級,根據(jù)優(yōu)先級的大小進行資源調度,而傳統(tǒng)方法依據(jù)各個路徑上的傳送列表信息以及擁塞情況對網(wǎng)絡情況進行預測,依據(jù)網(wǎng)絡實際情況分派適應的傳送任務量完成調度,忽略了不同資源的優(yōu)先級大小,容易出現(xiàn)緊急任務未被調度而非緊急任務提前被調度的情況,降低了資源效率的有效性。提出一種采用遺傳算法和蟻群算法的動態(tài)融合的異常入侵數(shù)據(jù)干擾下網(wǎng)絡資源調度優(yōu)化算法。該方法先根據(jù)網(wǎng)絡資源數(shù)據(jù)任務調度價值密度以及實行迫切性,構造動態(tài)優(yōu)先級。對于網(wǎng)絡資源數(shù)據(jù)在異常入侵數(shù)據(jù)干擾下的時間序列上的調度過程進行定義分析,給出了融合算法對網(wǎng)絡資源數(shù)據(jù)任務調度策略進行優(yōu)化的最佳動態(tài)融合過程,將上述方法應用于異常入侵數(shù)據(jù)干擾下的網(wǎng)絡資源數(shù)據(jù)任務調度中,仿真結果表明,改進方法可以提高異常入侵數(shù)據(jù)干擾下網(wǎng)絡資源調度的效率和準確性。
[Abstract]:The reasonable scheduling of network resources under the interference of abnormal intrusion data can improve the availability of network resources. When scheduling resources, we should obtain the dynamic priority of resources in the process of resource scheduling under the interference of abnormal intrusion data, and schedule resources according to the size of priority. The traditional methods predict the network situation according to the transmission list information on each path and the congestion situation, assign the appropriate transfer tasks according to the actual situation of the network to complete the scheduling, and ignore the priority of different resources. It is easy to have the emergency task not scheduled but not the emergency task to be scheduled ahead of schedule, which reduces the efficiency of resources. In this paper, a dynamic fusion of genetic algorithm and ant colony algorithm is proposed to optimize network resource scheduling under the interference of abnormal intrusion data. The dynamic priority is constructed according to the value density and urgency of resource task scheduling. This paper defines and analyzes the scheduling process of network resource data on the time series under the interference of abnormal intrusion data, and presents the optimal dynamic fusion process in which the fusion algorithm optimizes the task scheduling strategy of network resource data. The simulation results show that the improved method can improve the efficiency and accuracy of network resource scheduling under abnormal intrusion data interference.
【作者單位】： 新疆大學科學技術學院;
【分類號】：TP393.0;TP18

【相似文獻】

相關期刊論文 前5條

1 于泠;陳波;;入侵數(shù)據(jù)特征并行選擇算法[J];電子科技大學學報;2008年02期

2 黃國康;滕少華;;XML在入侵數(shù)據(jù)中的研究與應用[J];江西師范大學學報(自然科學版);2009年03期

3 鄧正宏;張陽;;基于核機器分類的入侵檢測數(shù)據(jù)分類方法的研究與設計[J];計算機工程與設計;2007年06期

4 遲茜;趙楠;;分類器動態(tài)集成的入侵數(shù)據(jù)流檢測算法[J];計算機工程與應用;2009年29期

5 ;[J];;年期

相關碩士學位論文 前2條

1 童紅艷;網(wǎng)絡入侵數(shù)據(jù)聚類分析研究[D];深圳大學;2015年

2 薛昱春;基于主機的入侵數(shù)據(jù)包檢測系統(tǒng)設計與實現(xiàn)[D];東南大學;2006年

，

本文編號：1996741