標題: PROFILING AND ACCELERATING STRING MATCHING ALGORITHMS IN THREE NETWORK CONTENT SECURITY APPLICATIONS
作者: Lin, Po-Ching
Li, Zhi-Xiang
Lin, Ying-Dar
Lai, Yuan-Cheng
Lin, Frank C.
資訊工程學系
Department of Computer Science
公開日期: 2006
摘要: The efficiency of string matching algorithms is essential for network content security applications, such as intrusion detection systems, anti-virus systems, and Web content filters. This work reviews typical algorithms and profiles their performance under various situations to study the influence of the number, the length, and the character distribution of the signatures on performance. This profiling can reveal the most efficient algorithm in each situation. A fast verification method for some string matching algorithms is also proposed. This work then analyzes the signature characteristics of three content security applications and replaces their original algorithms with the most efficient ones in the profiling. The improvement for both real and synthetic sample data is observed. For example, an open source anti-virus package, ClamAV, is five times faster after the revision. This work features comprehensive profiling results of typical string matching algorithms and observations of their application on network content security. The results can enlighten the choice of a proper algorithm in practical design.
URI: http://hdl.handle.net/11536/16985
http://dx.doi.org/10.1109/COMST.2006.315851
ISSN: 1553-877X
DOI: 10.1109/COMST.2006.315851
期刊: IEEE COMMUNICATIONS SURVEYS AND TUTORIALS
Volume: 8
Issue: 2
起始頁: 24
結束頁: 36
顯示於類別:期刊論文