Repository logo
  • English
  • 中文
  • Log In
    New user? Click here to register.Have you forgotten your password?
Repository logo
    Communities & Collections
    Research Outputs
    Fundings & Projects
    People
    Organizations
    Statistics
  • English
  • 中文
  • Log In
    New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Chung Shan Medical University
  3. Pure學術人才庫轉入
  4. A time- and memory- efficient string matching algorithm for intrusion detection systems
 
  • Details
Options

A time- and memory- efficient string matching algorithm for intrusion detection systems

Date Issued
2006-01-01
Author(s)
HSIAO-PING LEE  
DOI
10.1109/GLOCOM.2006.284
URI
https://www.scopus.com/pages/publications/50949113607
https://scholars.csmu.edu.tw/handle/123456789/33294
Abstract
Intrusion Detection Systems (IDSs) are known as useful tools for identifying malicious attempts over the network. The most essential part to an IDS is the searching engine that inspects every packet through the network. To strictly defend the protectorate, an IDS must be able to inspect packets at line rate and also provide guaranteed performance even under heavy attacks. Therefore, in this paper we propose an efficient string matching algorithm (named ACM) with compact memory as well as high worst-case performance. Using a magic number heuristic based on the Chinese Remainder Theorem, the proposed ACM significantly reduces the memory requirement without bringing complex processes. Furthermore, the latency of off-chip memory references is drastically reduced. The proposed ACM can be easily implemented in hardware and software. As a result, ACM enables cost-effective and efficient IDSs.
Type
journal article
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your Institution's web identity.

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback