期刊文献+

基于前导码挖掘的未知协议帧切分算法 被引量:2

Unknown protocol frame segmentation algorithm based on preamble mining
下载PDF
导出
摘要 针对未知协议帧切分技术存在的效率较低的问题,提出基于前导码挖掘的未知协议帧切分技术。首先介绍前导码作为标识链路帧起始位置的原理,分析候选序列选取问题是现有频繁序列挖掘方法无法对长度较长的前导码进行挖掘的原因,并针对该原因以及前导码挖掘的特点提出从目标比特流中发现候选序列、基于候选序列集合大小变化特征的候选序列选取等改进方法;然后提出未知前导码长度的判定与挖掘方法,从挖掘的众多频繁序列中找出前导码序列,进而对帧进行切分;最后通过采集的真实数据对所提方法的有效性进行了验证。实验结果表明,所提方法能够快速准确地挖掘未知协议比特流中的前导码序列,相比现有方法降低了空间与时间复杂度。 Concerning the poor efficiency in unknown protocol frame segmentation, an unknown protocol frame segmentation algorithm based on preamble mining was proposed. Firstly, the principle of the preamble being used as the start of frame was introduced. As the cause that the existing frequent sequence mining algorithm cannot mine long preamble directly, the problems in candidate sequence selection were analyzed. Combining with the characteristics of preamble, two methods for selecting candidate sequences from the target bit streams and selecting candidate sequence based on the variation of the size of candidate sequence set were given. Secondly, an algorithm inferring the length of preamble and mining the preamble was put forward for unknown protocol frame segmentation. Finally, experiments were conducted with real bit streams captured from the Ethernet. The experimental results show that the proposed algorithm can rapidly and accurately mine the preamble sequence in the bit stream of the unknown protocol with lower space and time complexity.
作者 雷东 王韬 王晓晗 马云飞 LEI Dong WANG Tao WANG Xiaohan MA Yunfei(Department of Information Engineering, Ordnance Engineering College, Shijiazhuang Hebei 050003, Chin)
出处 《计算机应用》 CSCD 北大核心 2017年第2期440-444,449,共6页 journal of Computer Applications
基金 国家自然科学基金资助项目(61272491 61309021)~~
关键词 前导码挖掘 频繁序列 帧切分 未知协议 比特流 preamble mining frequent sequence frame segmentation unknown protocol bit stream
  • 相关文献

参考文献7

二级参考文献55

  • 1曾玲,黄益盛.隐藏式帧同步技术探讨[J].信息安全与通信保密,2005,27(7):366-368. 被引量:1
  • 2马占欣,王新社,黄维通,陆玉昌.对最小置信度门限的置疑[J].计算机科学,2007,34(6):216-218. 被引量:5
  • 3俎云霄.基于高阶统计处理技术的m-序列检测及识别[J].电子与信息学报,2007,29(7):1576-1579. 被引量:18
  • 4Kopansky A and Bystrom M. Detection of a periodically embedded synchronization patterns on Rayleigh fading channels[J]. IEEE Transactions on Communications, 2006, 54(11): 1928-1932.
  • 5Chiani M and Martini M G. Practical frame synchronization for data with unknown distribution on AWGN channels[J]. IEEE Communications Letters, 2005, 9(5): 456-458.
  • 6Chiani M and Martini M G. On sequential frame synchronization in AWGN channels[J]. IEEE Transactions on Communications, 2006, 54(2): 339-348.
  • 7Batty K E and Adams E R. Detection and blind identification of m-sequence codes using higher order statistics[C]. Proceedings of IEEE on Signal Processing Workshop, Caesarea, Israel, June 14-16, 1999: 16-20.
  • 8Boyer RS, Moore JS. A fast string searching algorithm[ M]. Communications of the ACM20, 1977. 762- 772.
  • 9Sun W, Manber U. A Fast Algorithm For Multi-pattern Searching[ D]. The Computer Science Department of The University of Arizona, 1994.
  • 10Sun W, Manber U. Agrep-A Fast Approximate Pattem-matching Tool[M]. Usenix Winter Technical Conference, 1992.

共引文献87

同被引文献10

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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