Space and Speed Tradeoffs in TCAM Hierarchical Packet Classification Author: Alex Kesselman, Kirill Kogan, Sergey Nemzer, Michael Segal. Publisher: Sarnoff Symposium, 2008 Presenter: Chun-Yi Lee Date: 2009/08/11

Outline Introduction Model Description Space Optimization Speed Optimization Conclusion

Introduction Hierarchical Packet Classification on Traffic Control Hierarchical packet classification is a crucial mechanism necessary to support many Internet services such as QoS provisioning, traffic policing, and network intrusion detection. 3

Introduction Routing for multiple providers Internet Provider 1 interface1 Local Network Router Internet interface2 Provider 2 4

Introduction Hierarchical Packet Classification packet 1 packet 2 execute action packet 1 Rule 1 Rule 2 Rule 3 match match match packet 2 Rule 1 Rule 2 Rule 3 match match execute default action 5

Model Description Filter Type Exact match Prefix match Range match A packet header field Hi exactly matches the filter Fi if and only if Hi = Fi. Prefix match A packet header field Hi is a prefix match for the filter Fi if and only if the |Fi| bits of Hi are equal to Fi. Range match A packet header field Hi range matches the filter Fi if and only if Fi.min≦ Hi≦ Fi.max. 6

Model Description Classes and Policy C21 C31 Rule 1 Rule 1 C11 C22 packet Rule 2 Rule 2 Rule 1 Rule 1 Rule 3 C23 C33 Rule 1 Rule 1 7

Model Description Classes and Policy C11 C22 Rule 1 C32 C41 Rule 1 packet Rule 2 Rule 2 Rule 1 Rule 1 Rule 3 policy depth = 4 8