Scalable Multi-Field Packet Classification Using Fixed-Length Compression Bit Vector

作者: Jun Li , Xiaohe Hu , Jiaqi Gao

DOI:

关键词: Bit arrayFirewall (construction)HeaderComputer scienceComputer engineeringProcessing delayReal-time computingThroughputScalabilityData compressionNetworking hardware

摘要: Packet classification is one of the core techniques in network devices such as firewall, IDS and IPS. Tens thousands rules pose great pressure on algorithm terms memory requirements throughput. In this paper, a new packet algorithm, named Fixed-Length Compression Bit Vector (FLCBV), proposed based compression scheme FLC. Compared with traditional algorithms, FLC more adaptive to environment, especially large scale ruleset multi-field header. Experimental results demonstrate that FLCBV takes only 65% compared algorithms without losing much

参考文章(5)
Kamel Aouiche, Owen Kaser, Daniel Lemire, Sorting improves word-aligned bitmap indexes data and knowledge engineering. ,vol. 69, pp. 3- 28 ,(2010) , 10.1016/J.DATAK.2009.08.006
Ning Weng, Cheng-Liang Hsieh, Scalable Many-Field Packet Classification using Multidimensional-Cutting Via Selective Bit-Concatenation architectures for networking and communications systems. pp. 187- 188 ,(2015) , 10.5555/2772722.2772749
T. V. Lakshman, D. Stiliadis, High-speed policy-based packet forwarding using efficient multi-dimensional range matching acm special interest group on data communication. ,vol. 28, pp. 203- 214 ,(1998) , 10.1145/285237.285283
Y. Qi, L. Xu, B. Yang, Y. Xue, J. Li, Packet Classification Algorithms: From Theory to Practice international conference on computer communications. pp. 648- 656 ,(2009) , 10.1109/INFCOM.2009.5061972
Bo Xu, Dongyi Jiang, Jun Li, HSM: a fast packet classification algorithm advanced information networking and applications. ,vol. 1, pp. 987- 992 ,(2005) , 10.1109/AINA.2005.200