Minimizing rulesets for TCAM implementation

Proceedings - IEEE INFOCOM

Volumn , Issue , 2009, Pages 1314-1322

  McGeer, Rick ^a   Yalagandula, Praveen ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS CONTROL LISTS; ARTIFICIAL FILTER; DATA SETS; EXACT SOLUTION; LOGIC MINIMIZATION; MINIMIZATION PROBLEMS; OPTIMIZATION PROBLEMS; PACKET CLASSIFICATION; SET OF RULES; TERNARY CONTENT ADDRESSABLE MEMORIES; TOOLSUITE;

ABSTRACTING; ACCESS CONTROL; COMPUTER SYSTEM FIREWALLS; HEURISTIC METHODS; LOGIC DESIGN; LOGIC GATES; OPTIMIZATION;

PACKET NETWORKS;

EID: 70349653267     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2009.5062046     Document Type: Conference Paper

References (17)

1. Q. Dong, S. Banerjee, J. Wang, D. Agrawal, and A. Shukla, "Packet classifiers in ternary CAMs can be smaller," in Proc. SIGMETRICS, 2006, pp. 311-322.
2. A. Bremler-Barr and D. Hendler, "Space-Efficient TCAM-based Classification Using Gray Coding," in Proc. INFOCOM, 2007, pp. 1388-1396.
3. H. Che, Z. Wang, K. Zheng, and B. Liu, "DRES: Dynamic Range Encoding Scheme for TCAM Coprocessors," IEEE Transactions on Computers, 2008.
4. K. Lakshminarayanan, A. Rangarajan, and S. Venkatachary, "Algorithms for advanced packet classification with ternary CAMs," in Proc. SIGCOMM, 2005, pp. 193-204.
5. H. Liu, "Efficient Mapping of Range Classifier into Ternary-CAM," in Proc. HOT Interconnects, 2002, p. 95.
6. C. R. Meiners, A. X. Liu, and E. Torng, "Tcam razor: A systematic approach towards minimizing packet classifiers in tcams," in ICNP, 2007.
7. A. X. Liu, E. Torng, and C. Meiners, "Firewall compressor: An algorithm for minimizing firewall policies," in INFOCOM, Phoenix, Arizona, April 2008.
8. R. Brayton, A. Sangiovanni-Vincentelli, C. McMullen, and G. Hachtel, Logic Minimization Algorithms for VLSI Synthesis. Kluwer Academic Publishers, 1984.
9. D. E. Taylor and J. S. Turner, "ClassBench: a packet classification benchmark," IEEE/ACM Trans. Netw., vol. 15, no. 3, pp. 499-511, 2007.
10. R. M. Karp, Complexity of Computer Computations. Plenum, 1972, ch. Reducibility among Combinatorial Problems, pp. 85-103.
11. P. McGeer, J. Sanghavi, R. Brayton, and A. Sangiovanni-Vincentelli, "Espresso-signature: A new exact minimizer for logic functions," IEEE Transactions on VLSI Systems, vol. 1, no. 4, pp. 432-440, December 1993.
12. http://www.arl.wustl.edu/~det3/ClassBench/index.htm.
13. http://www.eecs.berkeley.edu/~alanmi/abc/.
14. A. X. Liu, C. R. Meiners, and Y. Zhou, "All-match based complete redundancy removal for packet classifiers in TCAMs," in INFOCOM, April 2008.
15. P. Gupta and N. McKeown, "Packet Classification on Multiple Fields," in Proc. SIGCOMM, 1999, pp. 147-160.
16. Q. Dong, S. Banerjee, J. Wang, and D. Agrawal, "Wire Speed Packet Classification Without TCAMs: A Few More Registers (And A Bit of Logic) Are Enough," in Proc. SIGMETRICS, 2007.
17. J. van Lunteren and A. Engbersen, "Fast and scalable packet classification," IEEE Journal of Selected Areas in Communications, 2003.