期刊文献+

入侵时长与网络信道受损关系建模仿真分析 被引量:3

Intrusion Time Modeling and Network Channel Damaged Relations
下载PDF
导出
摘要 网络入侵时间存在较强的无序性,与网络信道受损的关系比较复杂。传统的方法只能通过简单的线性关系对两者之间的关系进行描述,一旦入侵时间复杂程度增加,将会造成入侵时间非线性关联性急剧增加,导致模型的可信度降低。为此提出一种基于约束聚类算法的网络入侵时间与网络信道受损关系建模方法。根据模糊聚类相关原理建立网络入侵时间约束模糊聚类的目标函数,对该目标函数进行最小化变换处理,计算不同入侵时间次数的权重和对应的置信度,根据计算结果建立两者关系的模型。实验结果表明,利用改进算法进行入侵时间与信道受损关系建模,能够获取不同入侵次数对于信道受损程度的影响,保证了网络的安全。 Strong disorder exists in network intrusion time, thus damaged relationship with network channel is more complex. A modeling method of relationship of network intrusion time and network channel damaged was presented based on a clustering algorithm with constraint. According to the principle of fuzzy clustering, the objective function of fuzzy clustering constrained by network intrusion time was built. Then, the objective function was minimized, the weight and the number of different invasion time corresponding confidence level were calculated, and relationship between the models was established according to the calculation results. Experimental results show that the improved algorithm can obtain the influence of different number of invasion damage for the channel and ensure the safety of net-work.
作者 陶桦
出处 《计算机仿真》 CSCD 北大核心 2015年第1期327-330,共4页 Computer Simulation
关键词 网络入侵 模糊聚类 受损 关系建模 Network invasion Fuzzy clustering Damaged Relationship modeling
  • 相关文献

参考文献10

二级参考文献84

  • 1李建中,郭龙江,张冬冬,王伟平.数据流上的预测聚集查询处理算法[J].软件学报,2005,16(7):1252-1261. 被引量:24
  • 2谷保平,许孝元,郭红艳.基于粒子群优化的k均值算法在网络入侵检测中的应用[J].计算机应用,2007,27(6):1368-1370. 被引量:24
  • 3Bai Yuebin,Kobayashi H. Intrusion detection systems: teehnology and development[C]//Kawada S. Proeeedings of the 17th International Conference on Advanced Information Networking and Applications. Washington, DC: IEEE Computer Society, 2003 : 710-715.
  • 4Rroesch M. Snort-lightweight Intrusion detection for networks [C]//Ricketts S, Birdie C, Isaksson E. Proceedings of the 13th LISA Conference. Washington: USENIX, 1999: 229-238.
  • 5Brugger S T. Data mining methods for network intrusion detection[EB/OL].http://www-static.cc. gatech. edu/ -guofei/reading/brugger-dmnid.pdf, 2004.
  • 6Agrawal R, Srikant R. Fast algorithms for mining association rules [C]//Boeea J B, Jarke M, Zaniolo C. Proceed- ings of the 20th International Conference on Very Large Databases. San Francisco: Morgan Kaufmann Publishers Inc, 1994:487-499.
  • 7Rakesh A, Ramakrishnan S. Mining sequential patterns [C]//Yu P S, Chen ALP. Proceedings of the 11th International Conference on Data Engineering. Taipei: IEEE Computer Society, 1995: 3-14.
  • 8VAZHKUDAI S, SCHOPF J M. Using regression techniques to predict large data transfers[ J]. International ,Journal of High Performance Computing Applications,2003,17 ( 3 ) :249- 268.
  • 9FLETCHER A K, RANGAN S, GOYAL V K. Estimation from lossy sensor data :jump linear modeling and Kalman filtering [ C ]//Proc of the 3rd International Symposium on Information Processing in Sensor Networks. New York : ACM Press,2004:251 - 258.
  • 10LAZAREVIC A, KANAPADY R. Effective localized regression for damage detection in large complex mechanical structures [ C ]//Proc of Length ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York :ACM Press,2004:450-459.

共引文献108

同被引文献22

引证文献3

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部