To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org

1. GLOBALSOFT TECHNOLOGIES
Fast Regular Expression Matching Using Small TCAM
Abstract
Regular expression (RE) matching is a core component of deep packet inspection in modern networking
and security devices. In this paper, we propose the first hardware-based RE matching approach that
uses ternary content addressable memory (TCAM), which is available as off-the-shelf chips and has been
widely deployed in modern networking devices for tasks such as packet classification. We propose three
novel techniques to reduce TCAM space and improve RE matching speed: transition sharing, table
consolidation, and variable striding. We tested our techniques on eight real-world RE sets, and our
results show that small TCAMs can be used to store large deterministic finite automata (DFAs) and
achieve potentially high RE matching throughput. For space, we can store each of the corresponding
eight DFAs with 25 000 states in a 0.59-Mb TCAM chip. Using a different TCAM encoding scheme that
facilitates processing multiple characters per transition, we can achieve potential RE matching
throughput of 10-19 Gb/s for each of the eight DFAs using only a single 2.36-Mb TCAM chip.
Existing system
Regular expression (RE) matching is a core component of deep packet inspection in modern networking
and security devices. In this paper, we propose the first hardware-based RE matching approach that
uses ternary content addressable memory (TCAM), which is available as off-the-shelf chips and has been
widely deployed in modern networking devices for tasks such as packet classification.
Proposed system
IEEE PROJECTS & SOFTWARE DEVELOPMENTS
IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE
BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS
CELL: +91 98495 39085, +91 99662 35788, +91 98495 57908, +91 97014 40401
Visit: www.finalyearprojects.org Mail to:ieeefinalsemprojects@gmail.com

2. We propose three novel techniques to reduce TCAM space and improve RE matching speed: transition
sharing, table consolidation, and variable striding. We tested our techniques on eight real-world RE sets,
and our results show that small TCAMs can be used to store large deterministic finite automata (DFAs)
and achieve potentially high RE matching throughput. For space, we can store each of the corresponding
eight DFAs with 25 000 states in a 0.59-Mb TCAM chip. Using a different TCAM encoding scheme that
facilitates processing multiple characters per transition, we can achieve potential RE matching
throughput of 10-19 Gb/s for each of the eight DFAs using only a single 2.36-Mb TCAM chip.
SYSTEM CONFIGURATION:-
HARDWARE CONFIGURATION:-
 Processor - Pentium –IV
 Speed - 1.1 Ghz
 RAM - 256 MB(min)
 Hard Disk - 20 GB
 Key Board - Standard Windows Keyboard
 Mouse - Two or Three Button Mouse
 Monitor - SVGA
SOFTWARE CONFIGURATION:-
 Operating System : Windows XP
 Programming Language : JAVA
 Java Version : JDK 1.6 & above.