P2P流量的精细化识别方法研究
doi: 10.3724/SP.J.1146.2011.01283
Research on Fine Grained Identification of P2P Traffic
-
摘要: 目前,已有多种方法可高效准确地完成对P2P流量的粗识别,但对P2P流量的精细化识别研究较少。该文首次将近邻传播(Affinity Propagation, AP)算法引入该领域,在Hi-WAP算法的基础上融合半监督聚类思想提出了一种基于分层加权半监督近邻传播(Hierarchical Weighted Semi-supervised AP, Hi-WSAP)算法的P2P流量精细化识别方法。该方法仅利用10个可快速计算获取的网络流特征对P2P流量按应用进行半监督聚类。两组数据集下的实验结果表明,该方法识别准确率高,时间复杂度低,为P2P流量的实时精细化识别提供了一种实现思路。Abstract: Various methods are capable of classifying Peer to Peer (P2P) traffic in coarse grained way efficiently and accurately. However, few papers focus on the fine grained identification of P2P traffic. Affinity Propagation (AP) algorithm is brought to P2P traffic identification field for the first time and a novel method of identifying P2P traffic finely based on Hierarchical Weighted Semi-supervised AP (Hi-WSAP) algorithm is proposed, which is on the foundation of the Hi-WAP algorithm and absorbs the semi-supervised thought. The proposed method identifies P2P traffic in semi-supervised way by application employing only 10 fast computed traffic features. Experimental results using two datasets show this method achieves high identification accuracy and low time complexity, which provides a path to finely identify P2P traffic in real-time.
期刊类型引用(3)
1. 王玉,开晓山,朱士信. 一种2~m元域上量子纠错码的构造方法. 电子与信息学报. 2023(05): 1731-1736 . 本站查看
2. 张萍,李锦,黄山. 有限域上一类常循环BCH码. 数学进展. 2022(02): 375-383 . 百度学术
3. 孔波,徐明洁. 环F_(p~m)[u, v]/〈u~3=u, v~3=v, uv=vu〉上的常循环码. 河南教育学院学报(自然科学版). 2021(02): 5-8 . 百度学术
其他类型引用(1)
-
计量
- 文章访问数: 2344
- HTML全文浏览量: 107
- PDF下载量: 742
- 被引次数: 4