Journal on Communications ›› 2014, Vol. 35 ›› Issue (8): 162-168.doi: 10.3969/j.issn.1000-436x.2014.08.020

• Academic paper • Previous Articles     Next Articles

Low-power TCAM for regular expression matching

Lin-xuan DING1,Kun HUANG2,Da-fang ZHANG1   

  1. 1 College of Computer Science and Electronic Engineering, Hunan University, Changsha 410082, China
    2 Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190, China
  • Online:2014-08-25 Published:2017-06-29
  • Supported by:
    The National Basic Research Program of China (973 Program);The National Natural Science Foundation of China;The National Natural Science Foundation of China

Abstract:

A character-indexed regular expression matching algorithm was presented to address the limitations of TCAM power consumption. This algorithm used the idea of separating the alphabet table from the states in deterministic finite automaton (DFA) for building a character index, in order to reduce the number of activated TCAM blocks, which in turn translated low TCAM power. Experimental results showed that proposed algorithm reduces the TCAM power by 92.7% on average as well as the TCAM space usage by 32.0% on average, and improves the matching throughput by 57.9% on average compared to previous solutions based on DFA.

Key words: regular expression matching, character index, block-based storage, low power

No Suggested Reading articles found!