@article {116,
	title = {Efficient Multi-Match Packet Classification for Network Security Applications},
	journal = {IEEE Journal on Selected Areas in Communications},
	volume = {24},
	number = {2},
	year = {2006},
	month = {10/2006},
	chapter = {10},
	abstract = {New network applications like intrusion detection systems and packet-level accounting require multimatch packet classification, where all matching filters need to be reported. Ternary content addressable memories (TCAMs) have been adopted to solve the multimatch classification problem due to their ability to perform fast parallel matching. However, TCAMs are expensive and consume large amounts of power. None of the previously published multimatch classification schemes are both memory and power efficient. In this paper, we develop a novel scheme that meets both requirements by using a new set splitting algorithm (SSA). The main idea behind SSA is that it splits filters into multiple groups and performs separate TCAM lookups into these groups. It guarantees the removal of at least 1/2 the intersections when a filter set is split into two sets, thus resulting in low TCAM memory usage. SSA also accesses filters in the TCAM only once per packet, leading to low-power consumption. We compare SSA with two best known schemes: multimatch using discriminators (MUD) (Lakshminarayanan and Rangarajan, 2005) and geometric intersection-based solutions (Yu and Katz, 2004). Simulation results based on the SNORT filter sets show that SSA uses approximately the same amount of TCAM memory as MUD, but yields a 75\%-95\% reduction in power consumption. Compared with geometric intersection-based solutions, SSA uses 90\% less TCAM memory and power at the cost of one additional TCAM lookup per packet. We also show that SSA can be combined with SRAM/TCAM hybrid approaches to further reduce energy consumption},
	issn = {0733-8716},
	url = {http://www.comsoc.org/livepubs/sac/index.html},
	author = {F. Yu and Randy Katz and T. Lakshman}
}
