The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Algorithms to accelerate multiple regular expressions matching for deep packet inspection
Abstract
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most high performance systems that perform deep packet inspection implement simple string matching algorithms to match packets against a large, but finite set of strings. owever, there is growing interest in the use of regular expression-based pattern matching, since regular expressions offer superior expressive power and flexibility. Deterministic finite automata (DFA) representations are typically used to implement regular expressions. However, DFA representations of regular expression sets arising in network applications require large amounts of memory, limiting their practical application.In this paper, we introduce a new representation for regular expressions, called the Delayed Input DFA (D 2 FA), which substantially reduces space equirements as compared to a DFA. A D 2 FA is constructed by transforming a DFA via incrementally replacing several transitions of the automaton with a single default transition. Our approach dramatically reduces the number of distinct transitions between states. For a collection of regular expressions drawn from current commercial and academic systems, a D2FA representation reduces transitions by more than 95%. Given the substantially reduced space equirements, we describe an efficient architecture that can perform deep packet inspection at multi-gigabit rates. Our architecture uses multiple on-chip memories in such a way that each remains uniformly occupied and accessed over a short duration, thus effectively distributing the load and enabling high throughput. Our architecture can provide ostffective packet content scanning at OC-192 rates with memory requirements that are consistent with current ASIC technology.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Introduction to automata theory, languages and computation
(1981) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(81)90068-9 · Cited by 10,699
On the shortest spanning subtree of a graph and the traveling salesman problem
Kruskal, J. B. (1956) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1956-0078686-7 · Cited by 5,088
Shortest Connection Networks And Some Generalizations
Prim, R. C. (1957) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1957.tb01515.x · Cited by 4,565
Snort - Lightweight Intrusion Detection for Networks
Roesch, M. (1999) · Cited by 3,163
Efficient string matching: an aid to bibliographic search
Aho, A. V., & Corasick, M. J. (1975) · Communications of the ACM · doi:10.1145/360825.360855 · Cited by 2,944
A FAST ALGORITHM FOR MULTI-PATTERN SEARCHING
Wu, S., & Manber, U. (1999) · Cited by 490
Fast and memory-efficient regular expression matching for deep packet inspection
Fang, Y., Chen, Z., Diao, Y., Lakshman, T. V., & Katz, R. H. (2006) · ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) · doi:10.1145/1185347.1185360 · Cited by 469
Deep packet inspection using parallel bloom filters
Dharmapurikar, S., Krishnamurthy, P., Sproull, T. S., & Lockwood, J. W. (2004) · IEEE Micro · doi:10.1109/mm.2004.1268997 · Cited by 435
Self-citationEnhancing byte-level network intrusion detection signatures with context
Sommer, R., & Paxson, V. (2003) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/948109.948145 · Cited by 261
A lower bound for on-line bin packing
Liang, F. M. (1980) · Information Processing Letters · doi:10.1016/s0020-0190(80)90077-0 · Cited by 105
Cited by
Provably-Secure Logic Locking: From Theory To Practice
Yasin, M., Sengupta, A., Nabeel, M. T., Ashraf, M., Rajendran, J. (., & Sinanoglu, O. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3133985 · Cited by 336
Zeng, Y., Gu, H., Wei, W., & Guo, Y. (2019) · IEEE Access · doi:10.1109/access.2019.2908225 · Cited by 260
Machine Learning in Software Defined Networks: Data collection and traffic classification
Amaral, P., Dinis, J., Pinto, P., Bernardo, L., Tavares, J., & Mamede, H. S. (2016) · 2016 IEEE 24th International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.2016.7785327 · Cited by 172
Zhao, M., Gong, X., Liang, J., Wang, W., Que, X., & Cheng, S. (2015) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2014.2357094 · Cited by 86
Metadata
- Authors
- Kumar, S., Dharmapurikar, S., Yu, F., Crowley, P., & Turner, J.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2006-08-11
- Volume
- 36
- Issue
- 4
- Pages
- 339-350
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2096474000
- Cited by
- 509
- References
- 11
- FWCI
- 57.53
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.