Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Pinyin i2Cantonese i2Cangjie i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

2

ANCS
2006
ACM

favoriteEmaildiscussreport

141views Computer Networks» more ANCS 2006»

Fast and memory-efficient regular expression matching for deep packet inspection

12 years 12 months ago

Fast and memory-efficient regular expression matching for deep packet inspection

Download www.cs.umass.edu

Fang Yu, Zhifeng Chen, Yanlei Diao, T. V. Lakshman

Real-time Traffic

ANCS 2006 | Computer Networks |

claim paper

Related Content

» Advanced algorithms for fast and scalable deep packet inspection

» Algorithms to accelerate multiple regular expressions matching for deep packet inspection

» A workload for evaluating deep packet inspection architectures

» A hybrid finite automaton for practical deep packet inspection

» CacheBased Scalable Deep Packet Inspection with Predictive Automaton

» Reorganized and Compact DFA for Efficient Regular Expression Matching

» Ruler highspeed packet matching and rewriting on NPUs

» A NFAbased programmable regular expression match engine

» Compiling PCRE to FPGA for accelerating SNORT IDS

Post Info
More Details (n/a)

Added	13 Jun 2010
Updated	13 Jun 2010
Type	Conference
Year	2006
Where	ANCS
Authors	Fang Yu, Zhifeng Chen, Yanlei Diao, T. V. Lakshman, Randy H. Katz

Comments (0)