A Power and Throughput-Efficient Packet Classifier with n Bloom Filters

Abstract

Abstract-Packet classification is a critical data path in a highspeed router. Due to memory efficiency and fast lookup, Bloom filters (BFs) have been widely used for packet classification in a high-speed router. However, in a parallel packet classifier (PPC) of n parallel BFs, using all n BFs for a lookup is not throughput efficient in a high speed router. In this paper, we propose a multi-tiered packet classifier (MPC) for high throughput with the same memory size as a PPC. While a PPC of n BFs needs Θ(n) BF access complexity for a lookup, our MPC is geared to have the complexity which is probabilistically far less than Θ(n). Furthermore, by preprocessing a group of lookups in one cycle, each lookup is assigned to its associated BF at best effort, so that a higher throughput in an MPC is obtained. In simulation for flow identification with NLANR traces, we observed that, at most, 2.0 times more throughput was recorded than a PPC .

Multiclass Membership Determination Integrating an ID-Bound Method with Bloom Filter

“…Since a single BF could no longer handle the addressed problem, some researchers alter the bit array of BF to other forms, while others adhere to the original one and employ additional hash functions for resolving the issue. Yu and Mahapatra [22] proposed a multi-tier structure for saving power in dealing with packet classification on the Internet. Each tier is composed of several BFs for representing many classes of packets.…”

A hardware acceleration scheme for memory-efficient flow processing

“…The false positive problem of bloom filters can be alleviated by enlarging the size of the bit vector, increasing the number of hash functions, or having a small number of keys. Parallel bloom filters [3][4][5] have been introduced to achieve a lower false positive rate.…”

A New Stateless Packet Classification and Filter against DoS Attacks

“…In the Figure 3, the LI means the length of index table, and varies from 0 to 31, corresponding to 32 different kinds of capability length passage. The EBF, the extension of Bloom Filter [20], xor the capability firstly to obtain the 64-bit value of combination capability, then execute the Bloom Filter operation. The DM is the address generation module, and determines the final recording address.…”