ABC: Adaptive Binary Cuttings for Multidimensional Packet Classification
暂无分享,去创建一个
[1] George Varghese,et al. Scalable packet classification , 2005, IEEE/ACM Transactions on Networking.
[2] Nick McKeown,et al. Packet classification on multiple fields , 1999, SIGCOMM '99.
[3] George Varghese,et al. Fast and scalable layer four switching , 1998, SIGCOMM '98.
[4] George Varghese,et al. Packet classification using multidimensional cutting , 2003, SIGCOMM '03.
[5] Haoyu Song,et al. Shape shifting tries for faster IP route lookup , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).
[6] T. V. Lakshman,et al. High-speed policy-based packet forwarding using efficient multi-dimensional range matching , 1998, SIGCOMM '98.
[7] Mark H. Overmars,et al. Range Searching and Point Location among Fat Objects , 1996, J. Algorithms.
[8] 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).
[9] Pankaj Gupta,et al. Packet Classification using Hierarchical Intelligent Cuttings , 1999 .
[10] George Varghese,et al. Tree bitmap: hardware/software IP lookups with incremental updates , 2004, CCRV.
[11] McKeownNick,et al. Packet classification on multiple fields , 1999 .
[12] Jonathan S. Turner,et al. ClassBench: A Packet Classification Benchmark , 2005, IEEE/ACM Transactions on Networking.
[13] O. J. Murphy,et al. Designing Storage Efficient Decision Trees , 1991, IEEE Trans. Computers.
[14] Ronald L. Rivest,et al. Constructing Optimal Binary Decision Trees is NP-Complete , 1976, Inf. Process. Lett..