WANG Xiaofei, HU Chengchen, TANG Yi, ZHANG Ting, WU Chunming, LIU Bin, WANG Xiaojun. Parallel Length-based Matching Architecture for High Throughput Multi-Pattern Matching[J]. Chinese Journal of Electronics, 2012, 21(3): 489-494.
Citation: WANG Xiaofei, HU Chengchen, TANG Yi, ZHANG Ting, WU Chunming, LIU Bin, WANG Xiaojun. Parallel Length-based Matching Architecture for High Throughput Multi-Pattern Matching[J]. Chinese Journal of Electronics, 2012, 21(3): 489-494.

Parallel Length-based Matching Architecture for High Throughput Multi-Pattern Matching

  • Received Date: 2011-03-01
  • Rev Recd Date: 2011-04-01
  • Publish Date: 2012-07-25
  • Multi-pattern matching is a key technique for network security applications such as Network intrusion detection/protection systems (NIDS/NIPS). Deterministic finite automaton (DFA) is widely used for multipattern matching, while the link bandwidth and the traffic of the Internet are rapidly increasing, high performance and low storage cost DFA-based NIDS is strongly required. In this paper, we propose a parallel Length-based matching (LBM) architecture to increase the throughput without extra memory cost. The basic idea is to process multiple characters between some specific tags in parallel. We propose a multiple hash functions solution to reduce the possibility of false positive. The evaluation shows that our parallel architecture can reduce nearly 55% processing time with less memory consumption than the traditional DFA.
  • loading
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (513) PDF downloads(1424) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return