1 Wire Speed Packet Classification Without TCAMs: A Few More Registers (And A Bit of Logic) Are Enough Author: Qunfeng Dong, Suman Banerjee, Jia Wang, Dheeraj Agrawal Publisher: SIGMETRICS ’ 07 Presenter: Fang-Chen, Kuo

2 Motivation Cache Rules ! Evolving rules

3 Cache Evolving rules Hit ratio ↑ with less cache entries. Without using TCAM

4 Architecture

5 Classification Scheme (SPDD)

6 Cache Manager (Regular Hyper-Cube List)

7 Property of RHL 1. Each RHL element represents an evolving rule whose definition region is a d-dimensional hyper- cube. 2. Each hyper-cube in the RHL is colored by one single color in the coloring of the d-dimensional space defined by the original rule set. 3. Each sample packet in the sliding window is assigned to one evolving rule that matches it. 4. Evolving rules either have the same action or are non-overlapping. Check Overlap !

8 Rule Expanding

9 Hardware Design of Rule Cache

10 OPTIMIZATION (1/2) - PPDD (Pruned Packet decision Diagram)

11 OPTIMIZATION (2/2) – Ordering Packet Header Fields

12 Evaluation (1/6) We evaluate the performance of our smart rule cache using 4 real traffic traces and 10 real rule sets obtained from a tier-1 ISP backbone network. The decision of rules is either permit or deny.

13 Evaluation (2/6)- Memory Requirement The default ordering is: (1) source IP address; (2) destination IP address; (3) source port; (4) destination port; (5) protocol type. The best ordering is: (1)protocol type; (2)source IP address; (2) destination IP address; (3) source port; (4) destination port.

14 Evaluation (3/6)

15 Evaluation (4/6) – Cache Miss Ratio

16 Evaluation (5/6) – Sampling Interval

17 Evaluation (6/6) – Result for Complicated Rule Sets