Efficient construction of multibit tries for IP lookup

IEEE/ACM Transactions on Networking

Volumn 11, Issue 4, 2003, Pages 650-662

  Sahni, Sartaj ^a   Kim, Kun Suk ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Controlled prefix expansion; Dynamic programming; Longest matching prefix; Multibit trie; Packet routing

Indexed keywords

ALGORITHMS; COMPUTER WORKSTATIONS; DYNAMIC PROGRAMMING; ROUTERS;

PACKET ROUTING;

NETWORK PROTOCOLS;

EID: 0042238346     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2003.815288     Document Type: Article

References (18)

1. A. Bremler-Barr, Y. Afek, and S. Har-Peled, "Routing with a clue," in Proc. ACM SIGCOMM, 1999, pp. 203-214.
2. G. Chandranmenon and G. Varghese, "Trading packet headers for packet processing," IEEE/ACM Trans. Networking, vol. 4, pp. 141-152, Apr. 1996.
3. G. Cheung and S. McCanne, "Optimal routing table design for IP address lookups under memory constraints," in Proc. IEEE INFOCOMM, 1999, pp. 1437-1444.
4. M. Degermark, A. Brodnik, S. Carlsson, and S. Pink, "Small forwarding tables for fast routing lookups," in Proc. ACM SIGCOMM, 1997, pp. 3-14.
5. W. Doeringer, G. Karjoth, and M. Nassehi, "Routing on longestmatching prefixes," IEEE/ACM Trans. Networking, vol. 4, pp. 86-97, Feb. 1996.
6. M. Gray. (1996) Internet growth summary. [Online]. Available: http://www.mit.edu/people/mkgray/net/internet-growth-summary.html
7. E. Horowitz, S. Sahni, and D. Mehta, Fundamentals of Data Structures in C++. New York: Freeman, 1995.
8. B. Lampson, V. Srinivasan, and G. Varghese, "IP Lookup using multi-way and multicolumn search," in Proc. IEEE INFOCOM, 1998, pp. 1248-1256.
9. A. McAuley and P. Francis, "Fast routing table lookups using CAMs," in Proc. IEEE INFOCOM, 1993, pp. 1382-1391.
10. IPMA statistics (snapshot Sept. 13, 2000). Merit Network, Inc., Ann Arbor, MI. [Online]. Available: http://www.merit.edu/ipma
11. D. Milojicic. (2000) trend wars: Internet technology. IEEE Comput. Soc. [Online]. Available: http://www.computer.org/concurrency/articles/trendwars_200_l.htm
12. P. Newman, G. Minshall, and L. Huston, "IP switching and gigabit routers," IEEE Commun. Mag., vol. 35, pp. 64-69, Jan. 1997.
13. S. Nilsson and G. Karlsson, "Fast address look-up for Internet routers," in Proc. IFIP 4th Int. Conf. Broadband Communications, 1998, pp. 11-22.
14. S. Sahni, Data Structures, Algorithms, and Applications in Java. New York: McGraw-Hill, 2000.
15. K. Sklower, "A tree-based routing table for Berkeley Unix," Univ. of California, Berkeley, Tech. Rep., 1993.
16. V. Srinivasan and G. Varghese, "Faster IP lookups using controlled prefix expansion," ACM Trans. Comput. Syst., pp. 1-40, Feb. 1999.
17. A. Tammel, "How to survive as an ISP," in Proc. Networ ldlnterop, 1997.
18. M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, "Scalable high-speed IP routing lookups," in Proc. ACM SIGCOMM, 1997, pp. 25-36.