作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (20): 115-116. doi: 10.3969/j.issn.1000-3428.2009.20.040

• 网络与通信 • 上一篇    下一篇

基于信息熵的流量识别方法

吴 震1,刘兴彬2,童晓民1   

  1. (1. 国家计算机网络应急技术处理协调中心,北京 100029;2. 北京科技大学信息工程学院,北京 100083)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-10-20 发布日期:2009-10-20

Traffic Identification Method Based on Information Entropy

WU Zhen1, LIU Xing-bin2, TONG Xiao-min1   

  1. (1. National Computer Network Emergency Response Technical Team/Coordination Center of China, Beijing 100029;2. School of Information Engineering, University of Science and Technology Beijing, Beijing 100083)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-10-20 Published:2009-10-20

摘要: 针对当前基于流特征的流量识别方法准确率较低的问题,提出一种基于信息熵的流量识别方法,运用信息熵寻找显著特征,根据显著特征进行级联分簇。实验分析表明,该方法识别流和字节的准确率达90%以上,比单纯用K-Means等聚类算法的准确率提高10% 左右。

关键词: 流量识别, 信息熵, K-Means算法, 深度包探测

Abstract: In order to improve accuracy of identification traffic based on flow features, a new method of Traffic Identification Based on Information Entropy(TIBIE), which uses information entropy to find the notable features, and cascades clustering according to the notables features are put forward. Experimental results show that both the flow and byte accuracy rate of this method achieve 90% or more, which increase about 10% than the method that only based on K-Means clustering algorithm.

Key words: traffic identification, information entropy, K-Means algorithm, Deep Packet Inspecting(DPI)

中图分类号: