KUO-KUN TSENG, YUAN-CHENG LAI, YING-DAR LIN, and TSERN-HUEI LEE

Slides:

Advertisements

Similar presentations

Deep packet inspection – an algorithmic view Cristian Estan (U of Wisconsin-Madison) at IEEE CCW 2008.

Advertisements

SE-292 High Performance Computing

IP Router Architectures. Outline Basic IP Router Functionalities IP Router Architectures.

1 Overview Assignment 4: hints Memory management Assignment 3: solution.

SE-292 High Performance Computing Memory Hierarchy R. Govindarajan

Combinatorial Pattern Matching CS 466 Saurabh Sinha.

Fast and Scalable Pattern Matching for Content Filtering Sarang Dharmapurikar John Lockwood.

Space-Time Tradeoffs in Software-based Deep Packet Inspection Author: Anat Bremler-Barr, Yotam Harchol, and David Hay Published in Proc. IEEE HPSR 2011.

Authors: Wei Lin, Bin Liu Publisher: ICPADS, 2008 (IEEE International Conference on Parallel and Distributed Systems) Presenter: Chia-Yi, Chu Date: 2014/03/05.

1 Parallel Scientific Computing: Algorithms and Tools Lecture #2 APMA 2821A, Spring 2008 Instructors: George Em Karniadakis Leopold Grinberg.

Bio Michel Hanna M.S. in E.E., Cairo University, Egypt B.S. in E.E., Cairo University at Fayoum, Egypt Currently is a Ph.D. Student in Computer Engineering.

Reviewer: Jing Lu Gigabit Rate Packet Pattern- Matching Using TCAM Fang Yu, Randy H. Katz T. V. Lakshman UC Berkeley Bell Labs, Lucent ICNP’2004.

Combinatorial Pattern Matching CS 466 Saurabh Sinha.

A Memory-Efficient Reconfigurable Aho-Corasick FSM Implementation for Intrusion Detection Systems Authors: Seongwook Youn and Dennis McLeod Presenter:

KARL NADEN – NETWORKS (18-744) FALL 2010 Overview of Research in Router Design.

1 An Evolution of Pattern Matching within Network Intrusion Detection Systems Erik Anderson 9 November 2006.

1 High-performance packet classification algorithm for multithreaded IXP network processor Authors: Duo Liu, Zheng Chen, Bei Hua, Nenghai Yu, Xinan Tang.

Modified Data Structure of Aho-Corasick Project ECE-526 Spring 2006 Benfano Soewito, Ed Flanigan and John Pangrazio Southern Illinois University Carbondale.

1 A Fast Scalable Automaton-Matching Accelerator for Embedded Content Processors Authors: KUO-KUN TSENG, YUAN-CHENG LAI, YING-DAR LIN and TSERN-HUEI LEE.

An Efficient Hardware-based Multi-hash Scheme for High Speed IP Lookup Department of Computer Science and Information Engineering National Cheng Kung University,

1 Accelerating Multi-Patterns Matching on Compressed HTTP Traffic Authors: Anat Bremler-Barr, Yaron Koral Presenter: Chia-Ming,Chang Date: Publisher/Conf.

An Efficient and Scalable Pattern Matching Scheme for Network Security Applications Department of Computer Science and Information Engineering National.

Two stage packet classification using most specific filter matching and transport level sharing Authors: M.E. Kounavis *,A. Kumar,R. Yavatkar,H. Vin Presenter:

Modified Data Structure of Aho-Corasick Project ECE-526 Spring 2006 Benfano Soewito, Ed Flanigan and John Pangrazio Southern Illinois University Carbondale.

A Fast Algorithm for Multi-Pattern Searching Sun Wu, Udi Manber May 1994.

Caches Hakim Weatherspoon CS 3410, Spring 2012 Computer Science Cornell University See P&H 5.1, 5.2 (except writes)

Selecting and Implementing An Embedded Database System Presented by Jeff Webb March 2005 Article written by Michael Olson IEEE Software, 2000.

HOCT: A Highly Scalable Algorithm for Training Linear CRF on Modern Hardware presented by Tianyuan Chen.

Author ： Ozgun Erdogan and Pei Cao Publisher ： IEEE Globecom 2005 (IJSN 2007) Presenter ： Zong-Lin Sie Date ： 2010/12/08 1.

Accelerating Multipattern Matching on Compressed HTTP Traffic Published in : IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 20, NO. 3, JUNE 2012 Authors : Bremler-Barr,

Space-Time Tradeoffs in Software-Based Deep Packet Inspection Anat Bremler-Barr Yotam Harchol ⋆ David Hay IDC Herzliya, Israel Hebrew University, Israel.

Space-Time Tradeoffs in Software-Based Deep Packet Inspection Anat Bremler-Barr Yotam Harchol ⋆ David Hay IDC Herzliya, Israel Hebrew University, Israel.

6.375 Final Presentation Jeff Simpson, Jingwen Ouyang, Kyle Fritz FPGA Implementation of Whirlpool and FSB Hash Algorithms.

Efficient Instant-Fuzzy Search with Proximity Ranking Authors: Inci Centidil, Jamshid Esmaelnezhad, Taewoo Kim, and Chen Li IDCE Conference 2014 Presented.

TCAM –BASED REGULAR EXPRESSION MATCHING SOLUTION IN NETWORK Phase-I Review Supervised By, Presented By, MRS. SHARMILA,M.E., M.ARULMOZHI, AP/CSE.

Author : Sarang Dharmapurikar, John Lockwood Publisher : IEEE Journal on Selected Areas in Communications, 2006 Presenter : Jo-Ning Yu Date : 2010/12/29.

Chapter 8 Physical Database Design. Outline Overview of Physical Database Design Inputs of Physical Database Design File Structures Query Optimization.

Author : Yang Xu, Lei Ma, Zhaobo Liu, H. Jonathan Chao Publisher : ANCS 2011 Presenter : Jo-Ning Yu Date : 2011/12/28.

Author : Weirong Jiang, Yi-Hua E. Yang, and Viktor K. Prasanna Publisher : IPDPS 2010 Presenter : Jo-Ning Yu Date : 2012/04/11.

Updating Designed for Fast IP Lookup Author : Natasa Maksic, Zoran Chicha and Aleksandra Smiljani´c Conference: IEEE High Performance Switching and Routing.

TFA: A Tunable Finite Automaton for Regular Expression Matching Author: Yang Xu, Junchen Jiang, Rihua Wei, Yang Song and H. Jonathan Chao Publisher: ACM/IEEE.

A Fast Regular Expression Matching Engine for NIDS Applying Prediction Scheme Author: Lei Jiang, Qiong Dai, Qiu Tang, Jianlong Tan and Binxing Fang Publisher:

Virtual Memory Review Goal: give illusion of a large memory Allow many processes to share single memory Strategy Break physical memory up into blocks (pages)

SWM: Simplified Wu-Manber for GPU- based Deep Packet Inspection Author: Lucas Vespa, Ning Weng Publisher: The 2012 International Conference on Security.

The Anatomy of a Large-Scale Hypertextual Web Search Engine S. Brin and L. Page, Computer Networks and ISDN Systems, Vol. 30, No. 1-7, pages , April.

LightFlow : Speeding Up GPU-based Flow Switching and Facilitating Maintenance of Flow Table Author : Nobutaka Matsumoto and Michiaki Hayashi Conference:

1 “A picture speaks a thousand words.” Art By Ranjith & Waquas Islamiah Evening College.

SSAHA: A Fast Search Method For Large DNA Databases Zemin Ning, Anthony J. Cox and James C. Mullikin Seminar by: Gerry Kammerer © ETH Zürich.

Memory: Page Table Structure

Reorganized and Compact DFA for Efficient Regular Expression Matching

CPS216: Data-intensive Computing Systems

A DFA with Extended Character-Set for Fast Deep Packet Inspection

Efficient Filtering of XML Documents with XPath Expressions

Database Performance Tuning and Query Optimization

HEXA: Compact Data Structures for Faster Packet Processing

Advanced Algorithms for Fast and Scalable Deep Packet Inspection

Andy Wang Operating Systems COP 4610 / CGS 5765

實現於圖形處理器之高效能平行多字串比對算法 A High-Performance Parallel Multiple String Matching Algorithm on GPUs 林政宏副教授臺灣師範大學電機工程系

SigMatch Fast and Scalable Multi-Pattern Matching

Andy Wang Operating Systems COP 4610 / CGS 5765

Scalable Memory-Less Architecture for String Matching With FPGAs

2-Dimensional Pattern Matching

A Small and Fast IP Forwarding Table Using Hashing

Chapter 11 Database Performance Tuning and Query Optimization

Sarah Diesburg Operating Systems CS 3430

Andy Wang Operating Systems COP 4610 / CGS 5765

High-Performance Pattern Matching for Intrusion Detection

High Performance Pattern Matching using Bloom–Bloomier Filter

Authors: Ding-Yuan Lee, Ching-Che Wang, An-Yeu Wu Publisher: 2019 VLSI

Sarah Diesburg Operating Systems COP 4610

Presentation transcript:

A Fast Scalable Automaton-Matching Accelerator for Embedded Content Processors KUO-KUN TSENG, YUAN-CHENG LAI, YING-DAR LIN, and TSERN-HUEI LEE ACM Transactions on Embedded Computing Systems, April 2009. Also appeared in AINAW 2007, SYSARC 2007.

FSAM Fast scalable automaton-matching Bitmap-AC (INFOCOM 2004) based DPI Goal: Faster matching speed with space tradeoff Two techniques: Root-Index matching: for root state Pre-hash matching: for non-root states

Aho-Corasick Forward Transitions (To Deeper states) Given a states s, Depth(s): Depth(S4) = 2, Depth(S13) = 3 Label(s): Label(S4) = BD, Label(S13) = BCA Label(S12) = CDBCAB Forward Transitions (To Deeper states) Failure Transitions Failure Transitions to S0 are omitted

State Structure (1/3) Lookup Table Format Lookup Table format used in: (# of Forward transitions) more than 64.

State Structure(2/3) Linear Format S4 (S0) S5 (S7) D S6 S2 (S0) C S5 D S4 E S3

State Structure (3/3) Bitmap Format S5 (S7) 00010 S6 S2 (S0) 00111 S5 S4 S3

FSAM Algorithm Three Components: 1. Root-Index Matching 2. PreHash Matching 3. AC Matching (Bitmap-AC Matching)

PreHash (Overview)

PreHash (Idea) Using for non-root states. Quickly test multiple suffixes of the current state to avoid slow Bitmap AC matching (bitmap testing). Per-state vectors to keep the valid suffix information. Failure Transitions are included in valid suffix consideration. Testing result: Miss: Return to root state Hit: do Bitmap-AC matching

PreHash (Example)

Root-Index (Idea) Using for root state (S0) only Goal: Process multiple characters Issue: Memory explosion 256*256*256 … Solution: RFC-like (SIGCOMM 1999) data structure

Root-Index (Example)

Architecture (FPGA-based)

Parameter URL Patterns (SquidGuard) 194,096 states BitmapAC (SizeAC 6.85 MB) Kroot = 4 (Sizeroot 7.5 MB) Kprehash = 2 (Sizeprehash 3.23 MB) Virus Patterns (ClamAV) 402,173 states BitmapAC (SizeAC 14.19 MB) Kroot = 2 (Sizeroot 0.25 MB) Kprehash = 2 (Sizeprehash 4.97 MB)