Accelerating Pattern Matching Using a Novel Multi-Pattern-Matching Algorithm on GPU

• Published in: Applied sciences Vol. 13; no. 14; p. 8104
• Main Authors: Çelebi, Merve, Yavanoğlu, Uraz
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01.07.2023
• Subjects: Algorithms; Analysis; Cost control; Cyberterrorism; deep packet inspection; Field programmable gate arrays; Fraud; Malware; network security; Optimization techniques; pattern matching; Performance evaluation; Security software; Subtitles & subtitling; Technology application; Germany
• ISSN: 2076-3417; 2076-3417
• DOI: 10.3390/app13148104

Nowadays, almost all network traffic is encrypted. Attackers hide themselves using this traffic and attack over encrypted channels. Inspections performed only on packet headers and metadata are insufficient for detecting cyberattacks over encrypted channels. Therefore, it is important to analyze packet contents in applications that require control over payloads, such as content filtering, intrusion detection systems (IDSs), data loss prevention systems (DLPs), and fraud detection. This technology, known as deep packet inspection (DPI), provides full control over the communication between two end stations by keenly analyzing the network traffic. This study proposes a multi-pattern-matching algorithm that reduces the memory space and time required in the DPI pattern matching compared to traditional automaton-based algorithms with its ability to process more than one packet payload character at once. The pattern-matching process in the DPI system created to evaluate the performance of the proposed algorithm (PA) is conducted on the graphics processing unit (GPU), which accelerates the processing of network packets with its parallel computing capability. This study compares the PA with the Aho-Corasick (AC) and Wu–Manber (WM) algorithms, which are widely used in the pattern-matching process, considering the memory space required and throughput obtained. Algorithm tables created with a dataset containing 500 patterns use 425 and 688 times less memory space than those of the AC and WM algorithms, respectively. In the pattern-matching process using these tables, the PA is 3.5 and 1.5 times more efficient than the AC and WM algorithms, respectively.