Scalable packet classification through rulebase partitioning using the maximum entropy hashing

Authors:
Lynn Choi;Hyogon Kim;Sunil Kim;Moon Hae Kim
Affiliations:
Department of Electronics and Computer Engineering, Korea University, Seoul, Korea;Department of Computer and Communication Engineering, Korea University, Seoul, Korea;Department of Computer Engineering, Hongik University, Seoul, Korea;Department of Computer Science and Engineering, KonKuk University, Seoul, Korea
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2009

Citing 11
Cited 0

Fast and scalable layer four switching

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
High-speed policy-based packet forwarding using efficient multi-dimensional range matching

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Packet classification using tuple space search

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Packet classification on multiple fields

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Building Internet firewalls (2nd ed.)

Building Internet firewalls (2nd ed.)
Scalable packet classification

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Space Decomposition Techniques for Fast Layer-4 Switching

PfHSN '99 Proceedings of the IFIP TC6 WG6.1 & WG6.4 / IEEE ComSoc TC on on Gigabit Networking Sixth International Workshop on Protocols for High Speed Networks VI
Efficient Mapping of Range Classifier into Ternary-CAM

HOTI '02 Proceedings of the 10th Symposium on High Performance Interconnects HOT Interconnects
Gear up the Classifier: Scalable Packet Classification Optimization Framework via Rule Set Pre-Processing

ISCC '06 Proceedings of the 11th IEEE Symposium on Computers and Communications
Fast and scalable packet classification

IEEE Journal on Selected Areas in Communications
An evaluation of the key design criteria to achieve high update rates in packet classifiers

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a new packet classification algorithm, which can substantially improve the performance of a classifier. The algorithm is built on the observation that a given packet matches only a few rules even in large classifiers, which suggests that most of rules are independent in any given rulebase. The algorithm hierarchically partitions the rulebase into smaller independent subrulebases based on hashing. By using the same hash key used in the partitioning a classifier only needs to look up the relevant subrulebase to which an incoming packet belongs. For an optimal partitioning of rulebases, we apply the notion of maximum entropy to the hash key selection.We performed the detailed simulations of our proposed algorithm on synthetic rulebases of size 1 K to 500 K entries using real-life packet traces. The results show that the algorithm can significantly outperform existing classifiers by reducing the size of a rulebase by more than four orders of magnitude with just two-levels of partitioning. Both the time complexity and the space complexity of the algorithm exhibit linearity in terms of the size of a rulebase. This suggests that the algorithm can be a good scalable solution for medium to large rulebases.