Efficient packet classification using spatial cutting

To provide a more discriminating form of packet forwarding, a router has to determine how to forward a packet not only based on the destination address, but also other fields of the packet header, such as the source address, TCP and UDP port numbers. Since a router may contain a larger number of filters, it is a challenging work to design a packet classification algorithm with fast lookup speed and efficient memory usage. In this paper, we propose a spatial cutting scheme, which divides the filters into different groups from the viewpoint of space. For example, a two-dimensional filter can be seen as a rectangle in the space. The proposed scheme generates squares according to the filters. Each filter is covered by at least one square. Classifying a packet only requires two steps: locating the smallest square covering the packet and finding the matching filter in the square. Since the proposed scheme effectively divides the filters, it is able to provide fast lookup speed and reduce the required storage significantly.

[1]  Subhash Suri,et al.  Space Decomposition Techniques for Fast Layer-4 Switching , 1999, Protocols for High-Speed Networks.

[2]  Venkatachary Srinivasan,et al.  Packet classification using tuple space search , 1999, SIGCOMM '99.

[3]  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).

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

[5]  George Varghese,et al.  Packet classification for core routers: is there an alternative to CAMs? , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[6]  Anja Feldmann,et al.  Tradeoffs for packet classification , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[7]  Daxiao Yu,et al.  Forwarding engine for fast routing lookups and updates , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

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

[9]  George Varghese,et al.  Packet classification using multidimensional cutting , 2003, SIGCOMM '03.

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

[11]  Chia-Tai Chan,et al.  High-speed packet classification for differentiated services in next-generation networks , 2004, IEEE Transactions on Multimedia.

[12]  Jonathan S. Turner,et al.  ClassBench: a packet classification benchmark , 2005, INFOCOM 2005.

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

[14]  Huan Liu,et al.  Efficient mapping of range classifier into ternary-CAM , 2002, Proceedings 10th Symposium on High Performance Interconnects.

[15]  Bernhard Plattner,et al.  Scalable high speed IP routing lookups , 1997, SIGCOMM '97.

[16]  Walid Dabbous,et al.  Survey and taxonomy of IP address lookup algorithms , 2001, IEEE Netw..

[17]  Jonathan S. Turner,et al.  Packet classification using extended TCAMs , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

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