Efficient construction of fixed-stride multibit tries for IP lookup
暂无分享,去创建一个
[1] Ellis Horowitz,et al. Fundamentals of data structures in C , 1976 .
[2] Ellis Horowitz,et al. Fundamentals of Data Structures , 1984 .
[3] Peter Newman,et al. IP switching and gigabit routers , 1997, IEEE Commun. Mag..
[4] Bernhard Plattner,et al. Scalable high speed IP routing lookups , 1997, SIGCOMM '97.
[5] Sariel Har-Peled,et al. Routing with a clue , 2001, TNET.
[6] Svante Carlsson,et al. Small forwarding tables for fast routing lookups , 1997, SIGCOMM '97.
[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] Dejan S. Milojicic,et al. Trend Wars - Internet technology , 2000, IEEE Concurr..
[9] George Varghese,et al. Trading packet headers for packet processing , 1996, TNET.
[10] Gunnar Karlsson,et al. Fast address look-up for internet routers , 1998, Broadband Communications.
[11] Paul Francis,et al. Fast routing table lookup using CAMs , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.
[12] Sariel Har-Peled,et al. Routing with a clue , 1999, SIGCOMM '99.
[13] George Varghese,et al. Faster IP lookups using controlled prefix expansion , 1998, SIGMETRICS '98/PERFORMANCE '98.
[14] V. Srinivasan,et al. Fast address lookups using controlled prefix expansion , 1999, TOCS.
[15] Günter Karjoth,et al. Routing on longest-matching prefixes , 1996, TNET.