Tree-based string pattern matching on FPGAs
| dc.authorwosid | erdem, oğuzhan/AAG-6229-2019 | |
| dc.contributor.author | Erdem, Oguzhan | |
| dc.date.accessioned | 2024-06-12T11:15:41Z | |
| dc.date.available | 2024-06-12T11:15:41Z | |
| dc.date.issued | 2016 | |
| dc.department | Trakya Üniversitesi | en_US |
| dc.description.abstract | Network intrusion detection systems (NIDSs) monitor Internet Protocol (IP) traffic to detect anomalous and malicious activities on a network. Despite the plethora of studies in this field, hardware-based string matching engines that can accommodate the advancements in optical networking technology are still in high demand. Furthermore, memory efficient data structures to store intrusion patterns have recently received a great deal of research attention. In this paper, we introduce a tree-based pattern matching (TPM) scheme that comprises a forest of Binary Search Tree (BST) data structures and an accommodating high-throughput multi-pipelined architecture for scalable string matching on hardware. To improve the resource efficiency in hardware implementations, we enhanced TPM scheme (extended-TPM) with two novel tree structures, namely BST-epsilon (BST epsilon) and hierarchical BST (H-BST). Our entire design accomplishes a memory efficiency of 1.07 bytes/char for the latest Snort dictionary. Utilizing a state-of-the-art Field Programmable Gate Arrays (FPGAs), TPM architecture can sustain a throughput of 2.7 Gbps. (C) 2015 Elsevier Ltd. All rights reserved. | en_US |
| dc.identifier.doi | 10.1016/j.compeleceng.2015.11.025 | |
| dc.identifier.endpage | 133 | en_US |
| dc.identifier.issn | 0045-7906 | |
| dc.identifier.issn | 1879-0755 | |
| dc.identifier.scopus | 2-s2.0-84949657737 | en_US |
| dc.identifier.scopusquality | Q1 | en_US |
| dc.identifier.startpage | 117 | en_US |
| dc.identifier.uri | https://doi.org/10.1016/j.compeleceng.2015.11.025 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14551/24032 | |
| dc.identifier.volume | 49 | en_US |
| dc.identifier.wos | WOS:000368208100011 | en_US |
| dc.identifier.wosquality | Q3 | en_US |
| dc.indekslendigikaynak | Web of Science | en_US |
| dc.indekslendigikaynak | Scopus | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Pergamon-Elsevier Science Ltd | en_US |
| dc.relation.ispartof | Computers & Electrical Engineering | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.subject | String Matching | en_US |
| dc.subject | Intrusion Detection | en_US |
| dc.subject | FPGA | en_US |
| dc.subject | Binary Tree | en_US |
| dc.subject | NIDS | en_US |
| dc.title | Tree-based string pattern matching on FPGAs | en_US |
| dc.type | Article | en_US |
