Hierarchical multi-pattern matching algorithm for network content inspection

Sheu, Tzu-Fang; Huang, Nen-Fu; Lee, Hsiao-Ping

doi:10.1016/j.ins.2008.03.006

Cited by 9 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, it is still too large to store in the L1 cache of a network processor. The HMA uses hierarchical tables to improve the memory efficiency (9) . A small and simple first-tier table with 256 entries is designed to inspect each byte of a packet.…”

Section: Related Workmentioning

confidence: 99%

“…Since the latency of one L2 memory access is far larger than that of one L1 cache access, frequently accessing the external memory significantly degrades the throughput of a pattern matching algorithm. Sheu et al proposed a hierarchical multi-pattern matching algorithm (HMA), which can reduce the amount of external memory accesses by constructing small index tables for frequently accessed data (9) . However, the format of tables generated by the HMA is fixed, which makes the HMA unable to achieve good performance on different hardware architectures.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Fast and Scalable Multi-Pattern Matching Algorithm for Intrusion Detection Systems

Lee

Huang

Lu³

et al. 2015

The Proceedings of the 2nd International Conference on Industrial Application Engineering 2015

View full text Add to dashboard Cite

In order to protect networks from attacks, network intrusion detection systems (NIDS) have been widely deployed. These devices scan incoming packets to detect malicious content according to the predefined patterns. It is time consuming for NIDS to inspect each packet to check if it contains any patterns. In this paper, we propose a scalable and high-performance pattern matching algorithm. The key idea behind the proposed algorithm is to build a small and adjustable lookup table which can be completely stored in the on-chip memory of a network processor, and reduce the probability of accessing the external memory. Since the latency of one on-chip memory access is far smaller than that of one external memory access, the time required to inspect a packet can be greatly reduced. Simulation results show that the proposed algorithm is significantly better than the compared algorithm in terms of speed and scalability.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Fast and Scalable Multi-Pattern Matching Algorithm for Intrusion Detection Systems

Lee

Huang

Lu³

et al. 2015

The Proceedings of the 2nd International Conference on Industrial Application Engineering 2015

View full text Add to dashboard Cite

show abstract

“…It was shown that Aho-Corasick was the fastest algorithm for data with a binary alphabet while Wu-Manber outperformed the Aho-Corasick and Commentz-Walter algorithms on randomly generated data with an alphabet of size |Σ| = 4 and on data with an English and a Chinese language alphabet. HMA, a hierarchical multiple pattern matching algorithm was introduced in [80] and its performance was compared among others to the performance of a compressed version of the Aho-Corasick algorithm on data for Intrusion Detection Systems.…”

Section: Related Workmentioning

confidence: 99%

Parallel and distributed implementations of multiple and two-dimensional pattern matching algorithms

Kouzinopoulos¹,

Κουζινόπουλος²

View full text Add to dashboard Cite

Θα ήθελα να ευχαριστήσω τους γονείς μου για την αγάπη που μου έδειξαν και την υποστήριξή τους καθόλη τη διάρκεια των σπουδών μου και τους φίλους μου που ήταν δίπλα μου όταν τους χρειάστηκα. Ιδιαίτερα θα ήθελα να ευχαριστήσω τον επιβλέποντα Καθηγητή κ. Κωνσταντίνο Μαργαρίτη για την παρακολούθηση, τις σημαντικές παρατηρήσεις του και τη βοήθειά του κατά τη διάρκεια της εκπόνησης της διδακτορικής διατριβής καθώς και τον Λέκτορα κ. Παναγιώτη Μιχαηλίδη, τον Καθηγήτη κ. Γεώργιο Ευαγγελίδη και τον Αναπληρωτή Καθηγητή κ. Νικόλαο Σαμαρά για τις πολύτιμες παρατηρήσεις τους οι οποίες βοήθησαν στην βελτίωση του κειμένου της διατριβής. Θα ήθελα να ευχαριστήσω ονομαστικά όσους εργάστηκαν στο Εργαστήριο Παράλληλης και Κατανεμημένης Επεξεργασίας για την υποστήριξη και τη συμπαράστασή τους όλα αυτά τα χρόνια. Το Θέμη Πυργιώτη, τη Θάλεια Καρύδη, τη Σάντυ Μανουσαρίδου, τη Φωτεινή Τρίμμη, τη Βάσια Μολέ, την ΄ Αννα Κρασσά, τον Γιώργο Φώτη, τον Βαγγέλη Γρηγορόπουλο και τον Γιώργο Καλπάκη. Τέλος θα ήθελα να ευχαριστήσω θερμά όλους όσους συνέβαλαν με οποιοδήποτε τρόπο στην ολοκλήρωση της ερευνητικής προσπάθειας αυτής.

show abstract