Optimization of pattern matching algorithm for memory based architecture

Cheng Hung Lin*, Yu Tang Tai, Shih Chieh Chang

*此作品的通信作者

研究成果: 書貢獻/報告類型會議論文篇章

11 引文 斯高帕斯(Scopus)

摘要

Due to the advantages of easy re-configurability and scalability, the memory-based string matching architecture is widely adopted by network intrusion detection systems (NIDS). In order to accommodate the increasing number of attack patterns and meet the throughput requirement of networks, a successful NIDS system must have a memory-efficient pattern-matching algorithm and hardware design. In this paper, we propose a memory-efficient pattern-matching algorithm which can significantly reduce the memory requirement. For total Snort string patterns, the new algorithm achieves 29% of memory reduction compared with the traditional Aho-Corasick algorithm [5]. Moreover, since our approach is orthogonal to other memory reduction approaches, we can obtain substantial gain even after applying the existing state-of-the-art algorithms. For example, after applying the bit-split algorithm [9], we can still gain an additional 22% of memory reduction.

原文英語
主出版物標題ANCS'07 - Proceedings of the 2007 ACM Symposium on Architecture for Networking and Communications
頁面11-16
頁數6
DOIs
出版狀態已發佈 - 2007
對外發佈
事件3rd ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS 2007 - Orlando, FL, 美国
持續時間: 2007 12月 32007 12月 4

出版系列

名字ANCS'07 - Proceedings of the 2007 ACM Symposium on Architecture for Networking and Communications

其他

其他3rd ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS 2007
國家/地區美国
城市Orlando, FL
期間2007/12/032007/12/04

ASJC Scopus subject areas

  • 電腦網路與通信
  • 硬體和架構
  • 電氣與電子工程

指紋

深入研究「Optimization of pattern matching algorithm for memory based architecture」主題。共同形成了獨特的指紋。

引用此