Title :
Team [Ii][Ss][Uu][0–2]{4} design overview: MEMOCODE 2010 design contest
Author :
Vyas, Sudhanshu ; Mhapsekar, Pooja ; Ashok, Aditya ; Sayed, Moinuddin ; Srinivasa, Avinash ; Pandey, Gunjan ; Jackson, Adam ; Nelson, Matthew ; Saggi, Anand ; Sundararaman, Harini ; Jones, Phillip H.
Author_Institution :
Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA
Abstract :
This paper describes the architecture of a high-speed regular expression matching system implemented by the [Ii][Ss][Uu][0-2]{4} team from Iowa State University for the 2010 MEMOCODE competition. The purpose of this system is to detect malicious patterns in high-speed network data streams. The core functionality is implemented on a Stratix III 260 FPGA, and software running on a Xeon processor is used to transfer data to/from main memory and the FPGA. An interesting aspect of this architecture is the novel use of context switching resources to avoid buffering packets of connections whose classification are pending. The implemented solution detects malicious patterns at over 500 Mbps, and is estimated to scale to support well over 400 rules on our Stratix III FPGA.
Keywords :
field programmable gate arrays; microprocessor chips; FPGA; MEMOCODE competition; MEMOCODE design contest; Xeon processor; high speed network data stream; high speed regular expression matching system; malicious pattern detection; team design overview; Computer architecture; Context; Doped fiber amplifiers; Field programmable gate arrays; Hardware; Radiation detectors; Switches;
Conference_Titel :
Formal Methods and Models for Codesign (MEMOCODE), 2010 8th IEEE/ACM International Conference on
Conference_Location :
Grenoble
Print_ISBN :
978-1-4244-7885-9
Electronic_ISBN :
978-1-4244-7886-6
DOI :
10.1109/MEMCOD.2010.5558645