A paralleled Packet Classification algorithm based on Plus Bits and Bloom Filter

Packet classification (PC) is an important technology for next generation network services. Even though some PC algorithms for IPv6 have been proposed, most of them are precluded from commercial equipments due to high memory requirements, low searching speed, or expensive cost. In this paper, we propose an efficient paralleled IPv6 packet classification scheme; called Plus Bits and Bloom Filter based Packet Classification (B3PC). It introduces a small structure, called Plus Bits, which takes only 20 bits and can reduce many memory accesses by a few CPU operations. Meanwhile, we design a new searching scheme to make the highest priority match performance comparable to most specific match. Experimental results show that the hardware implementation of this scheme handles 4K rules by involving few memory, and finds the highest priority rule in about 8 memory accesses without regard to the single field searching.