Low-power TCAM for regular expression matching
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 n...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2014-08-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.08.020/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539234158084096 |
|---|---|
| author | Lin-xuan DING Kun HUANG Da-fang ZHANG |
| author_facet | Lin-xuan DING Kun HUANG Da-fang ZHANG |
| author_sort | Lin-xuan DING |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-d0c383c4f43f4dc99a51eebc88205afb |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2014-08-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-d0c383c4f43f4dc99a51eebc88205afb2025-01-14T07:25:22ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2014-08-013516216859683652Low-power TCAM for regular expression matchingLin-xuan DINGKun HUANGDa-fang ZHANGA 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.http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.08.020/regular expression matchingcharacter indexblock-based storagelow power |
| spellingShingle | Lin-xuan DING Kun HUANG Da-fang ZHANG Low-power TCAM for regular expression matching Tongxin xuebao regular expression matching character index block-based storage low power |
| title | Low-power TCAM for regular expression matching |
| title_full | Low-power TCAM for regular expression matching |
| title_fullStr | Low-power TCAM for regular expression matching |
| title_full_unstemmed | Low-power TCAM for regular expression matching |
| title_short | Low-power TCAM for regular expression matching |
| title_sort | low power tcam for regular expression matching |
| topic | regular expression matching character index block-based storage low power |
| url | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.08.020/ |
| work_keys_str_mv | AT linxuanding lowpowertcamforregularexpressionmatching AT kunhuang lowpowertcamforregularexpressionmatching AT dafangzhang lowpowertcamforregularexpressionmatching |