Accelerating network security services with fast packet classification

Authors:
Shiuhpyng Shieh;Fu-Yuan Lee;Ya-Wen Lin
Affiliations:
Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu 300, Taiwan;Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu 300, Taiwan;Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu 300, Taiwan
Venue:
Computer Communications
Year:
2004

Citing 9
Cited 2

Multidimensional access methods

ACM Computing Surveys (CSUR)
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
Multidimensional binary search trees used for associative searching

Communications of the ACM
Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases

ACM Computing Surveys (CSUR)
The K-D-B-tree: a search structure for large multidimensional dynamic indexes

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data

Online hybrid traffic classifier for Peer-to-Peer systems based on network processors

Applied Soft Computing
An efficient network intrusion detection

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

To protect a network, secure network systems such as intrusion detection system (IDS) and firewall are often installed to control or monitor network traffic. These systems often incur substantial delay for analyzing network packets. The delay can be reduced with fast packet classification, which can effectively classify network traffic, and consequently accelerate the analysis of network packets. In the last few years, many researchers devoted to providing fast packet classification methods for multidimensional classifier. However, these methods either suffer from poor performance and huge storage requirement, or are lack of dimension scalability. In this paper, we propose a packet classification method based on tuple space search, and use the multidimensional binary search tree (Kd-tree) to improve search performance. The proposed scheme requires only O(dlogW) search time and controlled storage requirement, where d is the number of dimensions, and W is the utmost bit length for specifying prefixes in a classification rule. It features fast packet classification, and supports dynamic update which is a basic requirement of many secure network services, such as IDS and firewall.