Fast Deep Packet Inspection with a Dual Finite Automata

Fast Deep Packet Inspectionwith a Dual Finite Automata

Cong Liu, Jie WuIEEE TC (Accepted)

Overview

• Focus: Memory Requirement• State Compression• Separate NFA states (lead to explosion) to distinct

automatas• Dual FA:– EDFA built from the remained states – LFA built from the distinct automatas

• Dual State per flow:– EDFA state + LFA state

2

Overview

• Transition may triggers state to be active:– EDFA -> EDFA– EDFA -> LFA– LFA -> EDFA– LFA -> LFA

3

4

[I-Q] match states 3, 4, 5

5

6

7

8

9

10

11

12

13

14

15

16

17

18