2009 · 84 citations · 29 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureField-programmable Gate ArraysReconfigurable ComputingField-programmable Gate Array ArchitectureFpga ArchitectureIntrusion DetectionLow-power Fpga DesignNetwork-on-chip DesignParallel ArchitecturesMatchingNetwork Intrusion DetectionNetwork-based Intrusion DetectionPacket ClassificationPacket ProcessingPower ConsumptionPower Consumption OptimizationThroughput
Multi-match packet classification is a critical function in network intrusion detection systems (NIDS), where all matching rules for a packet need to be reported. Most of the previous work is based on ternary content addressable memories (TCAMs) which are expensive and are not scalable with respect to clock rate, power consumption, and circuit area. This paper studies the characteristics of real-life Snort NIDS rule sets, and proposes a novel SRAM-based architecture. The proposed architecture is called field-split parallel bit vector (FSBV) where some header fields of a packet are further split into bit-level subfields. Unlike previous multi-match packet classification algorithms which suffer from memory explosion, the memory requirement of FSBV is linear in the number of rules. FPGA technology is exploited to provide high throughput and to support dynamic updates. Implementation results show that our architecture can store on a single Xilinx Virtex-5 FPGA the full set of packet header rules extracted from the latest Snort NIDS and sustains 100 Gbps throughput for minimum size (40 bytes) packets. The design achieves 1.25× improvement in throughput while the power consumption is approximately one fourth that of the state-of-the-art solutions.
29
Algorithms for packet classification
Pravir Singh Gupta, Nick McKeown · IEEE Network · 2001 · 653 citations
Packet classification on multiple fields
Pankaj Gupta, Nick McKeown · 1999 · 594 citations · Full text
Packet classification using multidimensional cutting
Sumeet Singh, Florin Baboescu, George Varghese et al. · 2003 · 536 citations · Full text