Scalable and Parallel Aggregated Bit Vector Packet Classification Using Prefix Computation Model

The Internet traffic gets exploded due to the increasing demand for bandwidth as more number of users gets added to the Internet. In order to meet the demands of the growing needs, the working of various devices and operations has to be redesigned. One of the areas is the design of the high performance router. The traditional router performs two basic tasks in forwarding a packet. Firstly, looking up the packet´s destination address in the router´s database and secondly, switching the packet to one or more of the outgoing links. The classification of packets at the router based upon multiple fields is called as packet classification. In this paper, we propose an aggregate bit vector packet classification using prefix computation model (ABVPC using PCM) which combines the effect of both scalability and parallelization. It is aimed at overcoming the defects of the existing ABV algorithms. Simulation results illustrate that the folding technique using PCM significantly improves the performance