Fast updating algorithms for TCAMs

IEEE Micro

Volumn 21, Issue 1, 2001, Pages 36-47

  Shah, Devavrat ^a   Gupta, Pankaj ^b  

^a STANFORD UNIVERSITY   (United States)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATIVE STORAGE; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONSTRAINT THEORY; DATA COMMUNICATION SYSTEMS; DATA STRUCTURES; ONLINE SYSTEMS; ROUTERS; TABLE LOOKUP; WAVELENGTH DIVISION MULTIPLEXING;

INTERNET ROUTERS; MEMORY DENSITY; PACKET CLASSIFICATION; TERNARY CONTENT ADDRESSABLE MEMORY;

ALGORITHMS;

EID: 0035108517     PISSN: 02721732     EISSN: None     Source Type: Journal    
DOI: 10.1109/40.903060     Document Type: Article

References (15)

1. Y. Rekhter and T. Li, "An Architecture for IP Address Allocation with CIDR," RFC 1518, 1993; http://rfc.net/rfc1518.html.
2. M. Waldvogel et al., "Scalable High-Speed IP Routing Lookups," Proc. ACM Sigcomm, ACM, N.Y., 1997, pp. 25-36.
3. A. Brodnik et al., "Small Forwarding Tables for Fast Routing Lookups," Proc. ACM Sigcomm, ACM, N.Y., 1997, pp. 3-13.
4. P. Gupta, S. Lin, and N. McKeown, "Routing Lookups in Hardware at Memory Access Speeds," Proc. INFOCOM, IEEE Press, Piscataway, N.J., 1998, pp. 1240-1247.
5. B. Lampson, V. Srinivasan, and G. Varghese, "IP Lookups Using Multiway and Multicolumn Search," Proc. INFOCOM, 1998, pp. 1248-1256.
6. S. Nilsson and G. Karlsson, "IP-Address Lookup Using LC-Tries," IEEE J. Selected Areas in Communications, vol. 17, no. 6, 1999, pp. 1083-1092.
7. V. Srinivasan and G. Varghese, "Fast Address Lookups Using Controlled Prefix Expansion," ACM Trans. Computer Systems, vol. 17, no. 1, Oct. 1999, pp. 1-40.
8. T.V. Lakshman and D. Stiliadis, "High-Speed Policy-Based Packet Forwarding Using Efficient Multidimensional Range Matching," Proc. ACM Sigcomm, ACM, N.Y., 1998, pp. 191-202.
9. V. Srinivasan et al., "Scalable Level 4 Switching and Fast Firewall Processing," Proc. ACM Sigcomm, 1998, pp. 203-214.
10. P. Gupta and N. McKeown, "Classifying Packets Using Hierarchical Intelligent Cuttings," IEEE Micro, vol. 20, no. 1, Jan. 2000, pp. 34-41.
11. P. Gupta and N. McKeown, "Packet Classification on Multiple Fields," Proc. ACM Sigcomm, ACM, N.Y., 1999, pp. 147-160.
12. M.M. Buddhikot, S. Suri, and M. Waldvogel, "Space Decomposition Techniques for Fast Layer-4 Switching," Protocols for High Speed Networks, vol. 66, no. 6, IFIP, Laxenburg, Austria/IEEE Computer Soc., Los Alamitos, Calif., Aug. 1999, pp. 277-283.
13. V. Srinivasan, G. Varghese, and S. Suri, "Fast Packet Classification Using Tuple Space Search," Proc. ACM Sigcomm, ACM, N.Y., 1999, pp. 135-46.
14. M. Kobayashi, T. Murase, and A. Kuriyama, "A Longest Prefix Match Search Engine for Multigigabit IP Processing," Proc. Int'l Conf. on Communications (ICC2000), IEEE Press, Piscataway, N.J., 2000, p. 1360.
15. C. Labovitz, G. R. Malan, and F. Jahanian, "Internet Routing Instability," IEEE/ACM Trans. Networking, vol. 6, no. 5, Oct. 1999, pp. 515-28.