efficient pattern matching algorithm for memory architecture
DESCRIPTION
Efficient Pattern Matching Algorithm for Memory Architecture. Author : Cheng-Hung Lin , Shih- Chieh Chang Publisher : Very Large Scale Integration (VLSI) Systems, IEEE Transactions on. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Efficient Pattern Matching Algorithm for Memory Architecture](https://reader034.vdocuments.mx/reader034/viewer/2022050806/56816553550346895dd7ccf5/html5/thumbnails/1.jpg)
Author : Cheng-Hung Lin , Shih-Chieh ChangPublisher : Very Large Scale Integration (VLSI) Systems, IEEE Transactions on
Efficient Pattern Matching Algorithm
for Memory Architecture
![Page 2: Efficient Pattern Matching Algorithm for Memory Architecture](https://reader034.vdocuments.mx/reader034/viewer/2022050806/56816553550346895dd7ccf5/html5/thumbnails/2.jpg)
In order to accommodate the increasing number of attack patterns and meet the throughput requirement of networks, a successful network intrusion detection system must have a memory-efficient pattern-matching algorithm and hardware design.
![Page 3: Efficient Pattern Matching Algorithm for Memory Architecture](https://reader034.vdocuments.mx/reader034/viewer/2022050806/56816553550346895dd7ccf5/html5/thumbnails/3.jpg)
This paper presented a memory-efficient pattern matching algorithm which can significantly reduce the number of states and transitions by merging pseudo-equivalent states while maintaining correctness of string matching. In addition, the new algorithm is complementary to other memory reduction approaches and provides further reductions in memory needs.
![Page 4: Efficient Pattern Matching Algorithm for Memory Architecture](https://reader034.vdocuments.mx/reader034/viewer/2022050806/56816553550346895dd7ccf5/html5/thumbnails/4.jpg)
![Page 5: Efficient Pattern Matching Algorithm for Memory Architecture](https://reader034.vdocuments.mx/reader034/viewer/2022050806/56816553550346895dd7ccf5/html5/thumbnails/5.jpg)
更改 match vector 成 pathVec 與 ifFinal ,
define similar states as pseudo-equivalent states(have identical input transitions , failure
transitions, and ifFinal bit , but different next states.)
Add a register, called preReg
![Page 6: Efficient Pattern Matching Algorithm for Memory Architecture](https://reader034.vdocuments.mx/reader034/viewer/2022050806/56816553550346895dd7ccf5/html5/thumbnails/6.jpg)
![Page 7: Efficient Pattern Matching Algorithm for Memory Architecture](https://reader034.vdocuments.mx/reader034/viewer/2022050806/56816553550346895dd7ccf5/html5/thumbnails/7.jpg)
![Page 8: Efficient Pattern Matching Algorithm for Memory Architecture](https://reader034.vdocuments.mx/reader034/viewer/2022050806/56816553550346895dd7ccf5/html5/thumbnails/8.jpg)
Example two patterns, “abcdefghijklm” and
“abcwsghidefxyklm.”label the substrings “abc”, “def”, “ghi”, and “klm” as “α” ”β” ”γ” ”δ” Pattern become” αβγjδ” and “αwsγβxyδ”Longest common subsecquence between two patterns are “ α β δ ” or ” α γ δ ”Calculate largest sharing gain
![Page 9: Efficient Pattern Matching Algorithm for Memory Architecture](https://reader034.vdocuments.mx/reader034/viewer/2022050806/56816553550346895dd7ccf5/html5/thumbnails/9.jpg)
![Page 10: Efficient Pattern Matching Algorithm for Memory Architecture](https://reader034.vdocuments.mx/reader034/viewer/2022050806/56816553550346895dd7ccf5/html5/thumbnails/10.jpg)
![Page 11: Efficient Pattern Matching Algorithm for Memory Architecture](https://reader034.vdocuments.mx/reader034/viewer/2022050806/56816553550346895dd7ccf5/html5/thumbnails/11.jpg)
![Page 12: Efficient Pattern Matching Algorithm for Memory Architecture](https://reader034.vdocuments.mx/reader034/viewer/2022050806/56816553550346895dd7ccf5/html5/thumbnails/12.jpg)