1 / 18

Fast Deep Packet Inspection with a Dual Finite Automata

Fast Deep Packet Inspection with a Dual Finite Automata. Cong Liu, Jie Wu IEEE 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

trung
Download Presentation

Fast Deep Packet Inspection with a Dual Finite Automata

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Fast Deep Packet Inspectionwith a Dual Finite Automata Cong Liu, Jie Wu IEEE TC (Accepted)

  2. 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

  3. Overview • Transition may triggers state to be active: • EDFA -> EDFA • EDFA -> LFA • LFA -> EDFA • LFA -> LFA

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

More Related