Reconfigurable finite-state machine based IP lookup engine for high-speed router

IEEE Journal on Selected Areas in Communications

Volumn 21, Issue 4, 2003, Pages 501-512

  Desai, Madhav ^a   Gupta, Ritu ^a,b   Karandikar, Abhay ^a   Saxena, Kshitiz ^a,c   Samant, Vinayak ^d  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^c SUN MICROSYSTEMS   (United States)

^d INDIAN INSTITUTE OF MANAGEMENT   (India)

Author keywords

Finite state machine (FSM); High speed Internet; Internet protocol (IP) address lookup; Routing; Wire speed performance

Indexed keywords

BANDWIDTH; COMPUTER ARCHITECTURE; COMPUTER HARDWARE; FINITE AUTOMATA; NETWORK PROTOCOLS;

FINITE STATE MACHINES (FSM);

ROUTERS;

EID: 0037609369     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2003.810498     Document Type: Article

References (23)

1. M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, "Scalable high-speed IP routing lookups," in Proc. ACM SIGCOMM'97, 1997, pp. 25-35.
2. M. Degermark, A. Brodnik, S. Carlsson, and S. Pink, "Small forwarding tables for fast routing lookups," in Proc. ACM SIGCOMM'97, 1997, pp. 3-14.
3. V. Srinivasan and G. Varghese, "Fast address lookup using controlled prefix expansion," in Proc. ACM SIGMETRICS'98, June 1998, pp. 1-11.
4. B. Lampson, V. Srinivasan, and G. Varghese, "IP lookup using multiway and multicolumn search," in Proc. IEEE INFOCOM'98, 1998, pp. 1248-1256.
5. P. Gupta and N. McKeown, "Routing lookups in hardware at memory access speeds," in Proc. IEEE INFOCOM'98, 1998, pp. 1240-1247.
6. W. Eatherton, "Full Tree Bit Map," Master's thesis, Washington Univ., St. Louis, 1999.
7. G. Cheung and S. McCanne, "Optimal routing table design for IP address lookups under memory constraints," in Proc. IEEE INFOCOM'99, 1999, pp. 1437-1444.
8. N. Huang and S. Zhao, "A novel IP routing lookup scheme and hardware architecture for multigigabit switching routers," IEEE J. Select. Areas Commun., vol. 17, pp. 1093-1104, June 1999.
9. M. Kobayashi, T. Murase, and A. Kuriyama, "A longest prefix match search engine for multi-gigabit IP processing," in Proc. ICC, 2000, pp. 1360-1363.
10. P. Wang, C. Chan, and Y. Chen, "A fast IP routing lookup scheme," in Proc. ICC, 2000, pp. 1140-1144.
11. M. Ruiz-Sanchez, E. Biersack, and W. Dabbous, "Survey and taxonomy of IP address lookup algorithms," IEEE Network Mag., pp. 8-23, Mar./Apr. 2001.
12. Prefix database Mac-East. [Online], Available: http://www.merit.edu/ipma
13. NetLogic Microsystems. (2001). [Online]. Available: http://www.netlogicmicro.com/
14. P. Gupta and D. Shah, "Fast updates on ternary-CAMs for packet lookups and classification," in Proc. Hot Interconnects VIII, Aug. 2000.
15. D. Morrison, "PATRICIA-A Practical Algorithm to Retrieve Information Coded in Alphanumeric," J. Assoc. Comput. Mach., vol. 15, no. 4, pp. 514-534, Oct. 1968.
16. S. Nilsson and G. Karlsson, "IP address lookup using LC tries," IEEE J. Select. Areas Commun., vol. 17, pp. 1083-1092, June 1999.
17. Z. Kohavi, Switching and Finite Automata Theory. New York: McGraw-Hill, 1996.
18. R. Shelar, M. Desai, and H. Narayanan, "Decomposition of finite state machines for area and delay minimization," in Proc. IEEE Int. Conf. Computer Design, 1999, pp. 620-625.
19. T. Villa and A. S. Sangiovanni Vincentenlli, "NOVA: state assignment for optimal two level logic implementation," IEEE Trans. Computer-Aided Design, vol. 9, pp. 905-924, Sept. 1990.
20. K. Saxena, "Finite State Machine Based Design for Packet Forwarding Engine," M.S. thesis (under Dual Degree), IIT, Bombay, India, June 2001.
21. R. Gupta, "Reconfigurable Hardware Design for Packet Router," M.S. thesis (under Dual Degree), HT, Bombay, India, June 2002.
22. SPICE3f5 User's Manual, Univ. California, Berkeley, CA, Mar, 1994.
23. [Online]. Available: http://www-device.eecs.berkeley.edu/bsim3