High Performance and High Scalable Packet Classification Algorithm for Network Security Systems

Abstract

Packet classification is a core function in network and security systems; hence, hardware-based solutions, such as packet classification accelerator chips or T-CAM (Ternary Content Addressable Memory), have been widely adopted for high-performance systems. With the rapid improvement of general hardware architectures and growing popularity of multi-core multi-threaded processors, software-based packet classification algorithms are attracting considerable attention, owing to their high flexibility in satisfying various industrial requirements for security and network systems. For high classification speed, these algorithms internally use large tables, whose size increases exponentially with the ruleset size; consequently, they cannot be used with a large rulesets. To overcome this problem, we propose a new software-based packet classification algorithm that simultaneously supports high scalability and fast classification performance by merging partition decision trees in a search table. While most partitioning-based packet classification algorithms show good scalability at the cost of low classification speed, our algorithm shows very high classification speed, irrespective of the number of rules, with small tables and short table building time. Our test results confirm that the proposed algorithm enables network and security systems to support heavy traffic in the most effective manner.Index Terms-Packet classification, partitioning, cache-aware table structure, integrated inter-and intra-table search.

Retracted: Visual Fusion of Network Security Data in Image Recognition

“…At present, the mainstream network security visualization tools mainly include ecarts, jtopo and JfreeChart. Echards and JfreeChart provide diversified icons, and jtopo provides topology visualization [17][18].…”

“…Compared with ecarts, JfreeChart has obvious defects: Although both are open source frameworks, JfreeChart's development manual needs to be purchased, while echards is completely free, which is more suitable for independent developers. Compared with echards, JfreeChart is not rich in visualization forms and only provides basic graphics, while ecarts also provides richer graphic effects such as network maps and dashboards [20].…”

Integrated Packet Classification to Support Multiple Security Policies for Robust and Low Delay V2X Services

“…Decision tree-based algorithm recursively chooses a child node according to the prede ned policy on decision tree built based on a rule-set until it reaches a leaf node [39][40][41][42][43][44][45][46][47]. If it reaches, it searches the matching rule with the highest priority among all rules stored in the leaf node.…”

Growth Rates in Algorithm Complexity: the Missing Link

“…The idea is also implicitly present in algorithm scalability discussions [13]. Oftentimes, when an argument for an algorithm being scalable is made, the performance measures are presented on a logarithmic scale.…”