基于前导码挖掘的未知协议帧切分算法

发布时间：2018-03-22 22:12

本文选题：前导码挖掘　切入点：频繁序列　出处：《计算机应用》2017年02期 　论文类型：期刊论文

【摘要】：针对未知协议帧切分技术存在的效率较低的问题,提出基于前导码挖掘的未知协议帧切分技术。首先介绍前导码作为标识链路帧起始位置的原理,分析候选序列选取问题是现有频繁序列挖掘方法无法对长度较长的前导码进行挖掘的原因,并针对该原因以及前导码挖掘的特点提出从目标比特流中发现候选序列、基于候选序列集合大小变化特征的候选序列选取等改进方法;然后提出未知前导码长度的判定与挖掘方法,从挖掘的众多频繁序列中找出前导码序列,进而对帧进行切分;最后通过采集的真实数据对所提方法的有效性进行了验证。实验结果表明,所提方法能够快速准确地挖掘未知协议比特流中的前导码序列,相比现有方法降低了空间与时间复杂度。
[Abstract]:In view of the low efficiency of the unknown protocol frame segmentation technology, an unknown protocol frame segmentation technique based on preamble mining is proposed. Firstly, the principle of using the preamble code to identify the starting position of the link frame is introduced. Analyzing the problem of candidate sequence selection is the reason why the existing frequent sequence mining methods can not mine the long preamble. According to this reason and the characteristics of preamble mining, we propose to find candidate sequences from the target bit stream. An improved method of selecting candidate sequences based on the variation of candidate sequence size is presented, and then an unknown preamble length determination and mining method is proposed to find the preamble sequences from many frequent sequences, and then segment the frames. Finally, the validity of the proposed method is verified by the real data collected. The experimental results show that the proposed method can quickly and accurately mine the preamble sequences in the unknown protocol bitstream. Compared with the existing methods, the complexity of space and time is reduced.
【作者单位】：军械工程学院信息工程系;
【基金】：国家自然科学基金资助项目(61272491,61309021)~~
【分类号】：TN975

【相似文献】