Xiang Wang
ABSTRACT
Most of state-of-the-art packet classification algorithms employ heuristics to trade off between classification speed and memory usage. However, intelligent heuristics often result in complex data structures in algorithm implementation. This brings difficulties to the deployment and optimization of packet classification algorithms. In this poster, a structural compression approach is presented for decision tree based packet classification algorithms. This approach exploits the similarity in real-life filter sets to achieve high compression ratio without loss of tree semantics.
- P. Gupta and N. McKeown. "Classifying Packets with Hierarchical Intelligent Cuttings," in IEEE Micro, 2000. Google Scholar
Digital Library
- Y. Qi, L. Xu, B. Yang, Y. Xue and J. Li. "Packet Clas-sification Algorithms: From Theory to Practice," in Proc. of INFOCOM, 2009.Google Scholar
- Y. Qi, B. Xu, F. He, B. Yang, J. Yu and J. Li. "Towards High-performance Flow-level Packet Processing on Multi-core Network Processors," in Proc. of ANCS, 2007. Google ScholarDigital Library
- ClassBench: A Packet Classification Benchmark. http://www.arl.wustl.edu/classbench/Google Scholar
- B. Vamanan, G. Voskuilen and T. Vijaykumar. "Effi-Cuts: Optimizing Packet Classification for Memory and Throughput," in Proc. of SIGCOMM, 2010. Google ScholarDigital Library
- J. Fong, Y. Qi, J. Li and W. Jiang. "ParaSplit: A Scalable Architecture on FPGA for Terabit Packet Classification," in Proc. of HOTI, 2012. Google ScholarDigital Library
Index Terms
- Structural compression of packet classification trees
Recommendations
On constructing efficient shared decision trees for multiple packet filters
INFOCOM'10: Proceedings of the 29th conference on Information communicationsMultiple packet filters serving different purposes (e.g., firewalling, QoS) and different virtual routers are often deployed on a single physical router. The HyperCuts decision tree is one efficient data structure for performing packet filter matching ...
Lossy Compression of Packet Classifiers
ANCS '15: Proceedings of the Eleventh ACM/IEEE Symposium on Architectures for networking and communications systemsPacket classification is a building block in many network services such as routing, filtering, intrusion detection, accounting, monitoring, load-balancing and policy enforcement. Compression has gained attention recently as a way to deal with the ...
Scalable Many-Field Packet Classification on Multi-core Processors
SBAC-PAD '13: Proceedings of the 2013 25th International Symposium on Computer Architecture and High Performance ComputingPacket classification matches a packet header against the predefined rules in a rule set, it is a kernel function that has been studied for decades. A recent trend in packet classification is to match a large number of packet header fields. For example, ...
Comments