基于流亲戚关系分组的流量识别算法  

Traffic Identification Based on Flow Relative Relation Group

作　　者：关卿 秦宏伟 张文超 

机构地区：[1]解放军63886部队

出　　处：《计算机与网络》2013年第2期54-57,共4页Computer & Network

摘　　要：本文在对当前的流量识别算法进行深入分析研究的基础上,提出了一种基于流亲戚关系分组的面向应用的流量识别算法。其主要思想就是仔细探究同一个应用程序所产生各流的相关依赖性,根据各流间的相关依赖性将流分组,同一组中的流可以认为是同一个应用程序产生的,该方法并不对包的有效载荷进行检测,因此效率和可适应性明显增强。论文对所提出的算法进行了验证,结果表明,该算法进行流量识别的准确率较高,并且具有较强的可扩展性。Aider the thorough analysis of nowaday algorithms of traffic identification, this paper proposes an application-level traffic identification algorithm based on flow relative relation group. The main idea is that through careful exploration of relations between flows generated from the same application, the flows are grouped based on the relations and the flows which have been grouped into the same group can be seemed as flows from the same application. This algorithm doesn＇t give examination on payload of packet, so its efficiency and applicability is better. We evaluated this algorithm. The results show that it has better scalability and better accuracy rate.

关 键 词：流亲戚关系分组 应用层流量识别 流亲戚关系计量 有效载荷检测算法 

分 类 号：TP393.06[自动化与计算机技术—计算机应用技术]