A scalable hardware solution for packet classification

One of interesting hardware solutions proposed to solve the packet classification problem is bit-vector algorithm. Different from other hardware solutions such as ternary CAM, it efficiently utilizes the memories to achieve an excellent performance in medium size policy database; however, it cannot scale up with the policy number increases. In this paper, we proposed an improved bit-vector algorithm named bit vector condensation, which can be adapted to large policy databases. Experiments showed that our proposed algorithm drastically improves in the storage requirements and search speed as compared to the original algorithm

[1]  Nick McKeown,et al.  Algorithms for packet classification , 2001, IEEE Netw..

[2]  George Varghese,et al.  Fast and scalable layer four switching , 1998, SIGCOMM '98.

[3]  Pankaj Gupta,et al.  Packet Classification using Hierarchical Intelligent Cuttings , 1999 .

[4]  George Varghese,et al.  Scalable packet classification , 2001, SIGCOMM 2001.

[5]  Nick McKeown,et al.  Packet classification on multiple fields , 1999, SIGCOMM '99.

[6]  Thomas Y. C. Woo A modular approach to packet classification: algorithms and results , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[7]  T. V. Lakshman,et al.  High-speed policy-based packet forwarding using efficient multi-dimensional range matching , 1998, SIGCOMM '98.

[8]  Nick McKeown,et al.  Classifying Packets with Hierarchical Intelligent Cuttings , 2000, IEEE Micro.