Packet Classification Using Pipelined Two-Dimensional Multibit Tries
暂无分享,去创建一个
[1] V. Srinivasan,et al. Fast address lookups using controlled prefix expansion , 1999, TOCS.
[2] Pankaj Gupta,et al. Packet Classification using Hierarchical Intelligent Cuttings , 1999 .
[3] Sartaj Sahni,et al. O(logW) multidimensional packet classification , 2007, TNET.
[4] Nick McKeown,et al. Packet classification on multiple fields , 1999, SIGCOMM '99.
[5] Sartaj Sahni,et al. Efficient construction of multibit tries for IP lookup , 2003, TNET.
[6] Sartaj Sahni,et al. One-Dimensional Packet Classification Using Pipelined Multibit Tries , 2005 .
[7] George Varghese,et al. Faster IP lookups using controlled prefix expansion , 1998, SIGMETRICS '98/PERFORMANCE '98.
[8] Sartaj Sahni,et al. Efficient Construction of Pipelined Multibit-Trie Router-Tables , 2007, IEEE Transactions on Computers.
[9] Sartaj Sahni,et al. Packet classification using two-dimensional multibit tries , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).
[10] Sartaj Sahni,et al. $O(\log W)$ Multidimensional Packet Classification , 2007, IEEE/ACM Transactions on Networking.
[11] Jonathan S. Turner,et al. ClassBench: a packet classification benchmark , 2005, INFOCOM 2005.
[12] Nick McKeown,et al. Classifying Packets with Hierarchical Intelligent Cuttings , 2000, IEEE Micro.
[13] George Varghese,et al. Scalable packet classification , 2001, SIGCOMM '01.
[14] Girija J. Narlikar,et al. Fast incremental updates for pipelined forwarding engines , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).