• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Computer Communication and Networks >Efficient Parallelization of Regular Expression Matching for Deep Inspection
【24h】

Efficient Parallelization of Regular Expression Matching for Deep Inspection

机译：深度检查的正则表达式匹配的高效并行化

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Regular expression matching has been widely used in today's network security systems, where the payloads of network packets are matched against a set of rules specified by regular expressions. Due to the increasing number of rules and the complex semantics of regular expressions, state-of-the-art regular expression matching techniques hardly meet the demands of network development. The rapid growth of parallel technology calls for an efficient parallel regular expression matching method. In this paper, we propose ParaRegex, a novel approach for fast parallel regular expression matching with high efficiency and low overhead. ParaRegex is a framework that implements data-parallel regular expression matching for finite automaton based methods. Experimental evaluation shows that ParaRegex produces a high-performance regular expression matching engine with low memory overhead and linear speed-up ratio, and obtains up to 6 times faster processing speed on a commodity multi-core workstation.
机译：正则表达式匹配已广泛应用于当今的网络安全系统，其中网络数据包的有效载荷与正则表达式指定的一组规则匹配。由于规则越来越多的规则和常规表达式的复杂语义，最先进的正则表达式匹配技术几乎不符合网络开发的需求。并行技术的快速增长呼叫有效并行正则表达式匹配方法。在本文中，我们提出了一种具有高效率和低开销的快速并行正则表达式匹配的新方法。 ParareGex是一种框架，它可以实现基于有限自动机的数据并行正则表达式匹配。实验评估表明，ParareGex产生具有低存储器开销和线性加速比的高性能正则表达式匹配引擎，并在商品多核工作站上获得高达6倍的加工速度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号