Boundary Cutting for Packet Classification

Decision-tree-based packet classification algorithms such as HiCuts, HyperCuts, and EffiCuts show excellent search performance by exploiting the geometrical representation of rules in a classifier and searching for a geometric subspace to which each input packet belongs. However, decision tree algorithms involve complicated heuristics for determining the field and number of cuts. Moreover, fixed interval-based cutting not relating to the actual space that each rule covers is ineffective and results in a huge storage requirement. A new efficient packet classification algorithm using boundary cutting is proposed in this paper. The proposed algorithm finds out the space that each rule covers and performs the cutting according to the space boundary. Hence, the cutting in the proposed algorithm is deterministic rather than involving the complicated heuristics, and it is more effective in providing improved search performance and more efficient in memory requirement. For rule sets with 1000-100 000 rules, simulation results show that the proposed boundary cutting algorithm provides a packet classification through 10-23 on-chip memory accesses and 1-4 off-chip memory accesses in average.

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

[2]  Sartaj Sahni,et al.  Packet classification consuming small amount of memory , 2005, IEEE/ACM Transactions on Networking.

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

[4]  Eric Torng,et al.  Topological Transformation Approaches to TCAM-Based Packet Classification , 2011, IEEE/ACM Transactions on Networking.

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

[6]  Rabi N. Mahapatra,et al.  A Memory-Efficient Hashing by Multi-Predicate Bloom Filters for Packet Classification , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[7]  Haoyu Song,et al.  Fast hash table lookup using extended bloom filter: an aid to network processing , 2005, SIGCOMM '05.

[8]  Butler W. Lampson,et al.  IP lookups using multiway and multicolumn search , 1999, TNET.

[9]  Joanne Treurniet,et al.  A Network Activity Classification Schema and Its Application to Scan Detection , 2011, IEEE/ACM Transactions on Networking.

[10]  Eric Torng,et al.  TCAM Razor: A Systematic Approach Towards Minimizing Packet Classifiers in TCAMs , 2007, 2007 IEEE International Conference on Network Protocols.

[11]  T. V. Lakshman,et al.  Efficient multimatch packet classification and lookup with TCAM , 2005, IEEE Micro.

[12]  David E. Taylor.  Survey and taxonomy of packet classification techniques , 2005, CSUR.

[13]  Sartaj Sahni,et al.  $O(\log W)$ Multidimensional Packet Classification , 2007, IEEE/ACM Transactions on Networking.

[14]  Nikil D. Dutt,et al.  On-chip vs. off-chip memory: the data partitioning problem in embedded processor-based systems , 2000, TODE.

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

[16]  George Varghese,et al.  Scalable packet classification , 2001, SIGCOMM '01.

[17]  Jonathan S. Turner,et al.  ClassBench: A Packet Classification Benchmark , 2005, IEEE/ACM Transactions on Networking.

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

[19]  Haoyu Song,et al.  Fast packet classification using bloom filters , 2006, 2006 Symposium on Architecture For Networking And Communications Systems.

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

[21]  Hyesook Lim,et al.  Hierarchical Binary Search Tree for Packet Classification , 2007, IEEE Communications Letters.

[22]  T. N. Vijaykumar,et al.  EffiCuts: optimizing packet classification for memory and throughput , 2010, SIGCOMM '10.

[23]  Haoyu Song,et al.  Efficient packet classification for network intrusion detection using FPGA , 2005, FPGA '05.

[24]  Hyogon Kim,et al.  Scalable Packet Classification Through Rulebase Partitioning Using the Maximum Entropy Hashing , 2009, IEEE/ACM Transactions on Networking.

[25]  T. V. Lakshman,et al.  Efficient Multimatch Packet Classification for Network Security Applications , 2006, IEEE Journal on Selected Areas in Communications.

[26]  Sartaj Sahni,et al.  O(logW) multidimensional packet classification , 2007, TNET.

[27]  Hyesook Lim,et al.  Hierarchical packet classification using a Bloom filter and rule-priority tries , 2010, Comput. Commun..

[28]  Hung-Hsiang Jonathan Chao,et al.  Next generation routers , 2002, Proc. IEEE.

[29]  Sartaj Sahni,et al.  Succinct Representation of Static Packet Classifiers , 2007, IEEE/ACM Transactions on Networking.

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

[31]  Fang Hao,et al.  Efficient Trie Braiding in Scalable Virtual Routers , 2012, IEEE/ACM Transactions on Networking.

[32]  Hyesook Lim,et al.  High-speed packet classification using binary search on length , 2007, ANCS '07.

[33]  Haoyu Song,et al.  Packet classification using coarse-grained tuple spaces , 2006, 2006 Symposium on Architecture For Networking And Communications Systems.

[34]  Chia-Tai Chan,et al.  Scalable Packet Classification for Enabling Internet Differentiated Services , 2006, IEEE Transactions on Multimedia.

[35]  So-Yeon Kim,et al.  Tuple Pruning Using Bloom Filters for Packet Classification , 2009, IEEE Micro.

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

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

[38]  Hyesook Lim,et al.  Two-dimensional packet classification algorithm using a quad-tree , 2007, Comput. Commun..