• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Ding Linxuan, Huang Kun, Zhang Dafang. Multi-Stride Regular Expression Matching Using Parallel Character Index[J]. Journal of Computer Research and Development, 2015, 52(3): 681-690. DOI: 10.7544/issn1000-1239.2015.20131255
Citation: Ding Linxuan, Huang Kun, Zhang Dafang. Multi-Stride Regular Expression Matching Using Parallel Character Index[J]. Journal of Computer Research and Development, 2015, 52(3): 681-690. DOI: 10.7544/issn1000-1239.2015.20131255

Multi-Stride Regular Expression Matching Using Parallel Character Index

More Information
  • Published Date: February 28, 2015
  • Deep packet inspection (DPI) is a key function of network intrusion detection and prevention systems (NIDPS). TCAM-based regular expression matching algorithms have been proposed as a promising approach to improve processing speed, which is an important research direction of DPI. Ternary content addressable memory (TCAM) has the characters of high searching speed and small storage space, as well as the TCAM power consumption is proportionate to its storage space. Deterministic finite automaton (DFA) requires large storage space and the storage space of multi-stride DFA grows exponentially with the stride of DFA, which leads to high TCAM power consumption of DFA, especially for multi-stride DFA. This paper presents a parallel character-indexed multi-stride regular expression matching algorithm to address such limitation. This algorithm uses the idea of building parallel character indexes according to the stride of DFA, and reduces the number of activated TCAM blocks by using bitmap intersection, which in turn translates low TCAM power. Experimental results show that our algorithm reduces the TCAM power by more than 99.8% as well as the TCAM space usage by 48.5%~65.3%, and improves the matching throughput by 1.9~2.6 times compared with previous solutions based on multi-stride DFA.
  • Related Articles

    [1]He Yanxiang, Chen Yong, Wu Wei, Xu Chao, Li Qingan. Bus-Invert Encoding Oriented Low Power Scheduling Method[J]. Journal of Computer Research and Development, 2014, 51(8): 1773-1780. DOI: 10.7544/issn1000-1239.2014.20130066
    [2]Yuan Bo, Dai Yi, Wang Binqiang. A Low-Power FIS Mechanism and Energy Analysis for Green Router[J]. Journal of Computer Research and Development, 2014, 51(5): 984-996.
    [3]Song Lihua, Guo Yanfei, Wang Qin. Algorithm-Level Low-Power Technology for the Channel Decoding Coprocessor of the Network Processor[J]. Journal of Computer Research and Development, 2012, 49(8): 1641-1648.
    [4]Wang Weizheng, Kuang Jishun, You Zhiqiang, Liu Peng. A Low-Power and Low-Cost BIST Scheme Based on Capture in Turn of Sub-Scan Chains[J]. Journal of Computer Research and Development, 2012, 49(4): 864-872.
    [5]Zhao Xia, Chen Xiangqun, Guo Yao, Yang Fuqing. A Survey on Operating System Power Management[J]. Journal of Computer Research and Development, 2008, 45(5): 817-824.
    [6]Ma Zhiqiang, Ji Zhenzhou, and Hu Mingzeng. A Low Power Data Cache Design Based on Very Narrow-Width Value[J]. Journal of Computer Research and Development, 2007, 44(5): 775-781.
    [7]Wang Wei, Han Yinhe, Hu Yu, Li Xiaowei, Zhang Yousheng. An Effective Low-Power Scan Architecture—PowerCut[J]. Journal of Computer Research and Development, 2007, 44(3).
    [8]Lei Ting, Li Xi, and Zhou Xuehai. Performance Lossless Voltage Scheduling for Low Energy Software[J]. Journal of Computer Research and Development, 2006, 43(6): 1090-1096.
    [9]Ma Zhiqiang, Ji Zhenzhou, and Hu Mingzeng. A Low-Power Instruction Cache Design Based on Record Buffer[J]. Journal of Computer Research and Development, 2006, 43(4): 744-751.
    [10]Hu Xiao, Li Xi, and Gong Yuchang. High-Level Low-Power Synthesis of Real-Time Systems Using Time Petri Nets[J]. Journal of Computer Research and Development, 2006, 43(1): 176-184.

Catalog

    Article views (1200) PDF downloads (645) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return