Packet classification is widely used in various network security and operation applications. Two of the main challenges are the increasing number of classification rules, amount of traffic and network line speed. In this poster, we investigate an approximation algorithm for selecting the top- most frequently matched subset of rules from the original ruleset. Through simulations, we show that our approaches the optimal while runs in seconds, allowing online adaptation to changing traffic patterns. Categories and Subject Descriptors C.2.0 [Computer Communication Networks]: General, Security and protection (e.g., firewalls), Packet Classification General Terms Algorithms, Design, Security, Packet Classification
Ho-Yu Lam, Donghan (Jarod) Wang, H. Jonathan Chao