Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching
暂无分享,去创建一个
[1] Günter Karjoth,et al. Routing on longest-matching prefixes , 1996, TNET.
[2] Stephen P. Boyd,et al. Near-optimal routing lookups with bounded worst case performance , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[3] Nick McKeown,et al. A simulation study of IP switching , 1997, SIGCOMM '97.
[4] Nick McKeown,et al. Dynamic Algorithms with Worst-Case Performance for Packet Classification , 2000, NETWORKING.
[5] Edward M. McCreight,et al. Priority Search Trees , 1985, SIAM J. Comput..
[6] Sartaj Sahni,et al. O(log n) Dynamic Router-Tables for Prefixes and Ranges , 2004, IEEE Trans. Computers.
[7] Steven McCanne,et al. Optimal routing table design for IP address lookups under memory constraints , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).
[8] Gunnar Karlsson,et al. Fast address look-up for internet routers , 1998, Broadband Communications.
[9] Funda Ergün,et al. A dynamic lookup scheme for bursty access patterns , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[10] George Varghese,et al. Faster IP lookups using controlled prefix expansion , 1998, SIGMETRICS '98/PERFORMANCE '98.
[11] Bernhard Plattner,et al. Scalable high speed IP routing lookups , 1997, SIGCOMM '97.
[12] Svante Carlsson,et al. Small forwarding tables for fast routing lookups , 1997, SIGCOMM '97.
[13] George C. Polyzos,et al. A Parameterizable Methodology for Internet Traffic Flow Profiling , 1995, IEEE J. Sel. Areas Commun..
[14] Sartaj Sahni,et al. Efficient construction of variable-stride multibit tries for IP lookup , 2002, Proceedings 2002 Symposium on Applications and the Internet (SAINT 2002).
[15] SuriSubhash,et al. Multiway range trees , 2004 .
[16] Ellis Horowitz,et al. Fundamentals of data structures in C , 1976 .
[17] 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).
[18] Sartaj Sahni,et al. Efficient Dynamic Lookup For Bursty Access Patterns , 2004, Int. J. Found. Comput. Sci..