A Hybrid Approach to Packet Classification

Packet classification is one of the key technologies to support differentiated services to classified flows. Combining the top-down lookup tree structure and intelligent constructing strategy of present algorithms, this paper proposes a hybrid approach to packet classification. The filter set, which is used to classify packets, are stored in the leaf chains of a special data structure, in which an index table acts as index to locate several lookup trees. Also, an evaluation formula shows the major criteria on how to build lookup trees and distribute filters to obtain satisfactory efficiency. The performance of the proposed algorithm is discussed by analytical computation and simulation. Theoretically, it has a logarithmic execution time cost with a polynomial space (storage) cost. Further, a simulation of packet classifier built on IBM Power Network Processor is performed to test its performance and do a comparison between multi-tree applied cases and the unapplied. The results show its superiority in complex filter handling and matching modes.

[1]  Larry L. Peterson,et al.  PathFinder: A Pattern-Based Packet Classifier , 1994, OSDI.

[2]  Yusheng Ji,et al.  Virtual Rate-Based Queueing : A Generalized Queueing Discipline for Switches in High-Speed Networks , 1994 .

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

[5]  Jeffrey C. Mogul,et al.  The packer filter: an efficient mechanism for user-level network code , 1987, SOSP '87.

[6]  Sundar Iyer,et al.  ClassiPl: an architecture for fast and flexible packet classification , 2001, IEEE Netw..

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

[8]  Venkatachary Srinivasan,et al.  A packet classification and filter management system , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[10]  Henry Hong-Yi Tzeng.  Longest Prefix Search Using Compressed Trees , 1998 .

[11]  Brian N. Bershad,et al.  Efficient Packet Demultiplexing for Multiple Endpoints and Large Messages , 1994, USENIX Winter.

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

[13]  George Varghese,et al.  Fast packet classification for two-dimensional conflict-free filters , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[14]  T. V. Lakshman,et al.  Beyond best effort: router architectures for the differentiated services of tomorrow's Internet , 1998, IEEE Commun. Mag..

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

[16]  Steven McCanne,et al.  The BSD Packet Filter: A New Architecture for User-level Packet Capture , 1993, USENIX Winter.

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