This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Chemical Reaction Optimization for Task Scheduling in Grid Computing
Oct. 2011 (vol. 22 no. 10)
pp. 1624-1631
Jin Xu, The University of Hong Kong, Hong Kong
Albert Y.S. Lam, University of California, Berkeley, Berkeley
Victor O.K. Li, The University of Hong Kong, Hong Kong and Saud University, Saudi Arabia
For the low-cost hardware-based intrusion detection systems, this paper proposes a memory-efficient parallel string matching scheme. In order to reduce the number of state transitions, the finite state machine tiles in a string matcher adopt bit-level input symbols. Long target patterns are divided into subpatterns with a fixed length; deterministic finite automata are built with the subpatterns. Using the pattern dividing, the variety of target pattern lengths can be mitigated, so that memory usage in homogeneous string matchers can be efficient. In order to identify each original long pattern being divided, a two-stage sequential matching scheme is proposed for the successive matches with subpatterns. Experimental results show that total memory requirements decrease on average by 47.8 percent and 62.8 percent for Snort and ClamAV rule sets, in comparison with several existing bit-split string matching methods.
Index Terms:
Computer network security, finite state machines, site security monitoring, string matching.
Citation:
Jin Xu, Albert Y.S. Lam, Victor O.K. Li, "Chemical Reaction Optimization for Task Scheduling in Grid Computing," IEEE Transactions on Parallel and Distributed Systems, vol. 22, no. 10, pp. 1624-1631, Oct. 2011, doi:10.1109/TPDS.2011.35
Usage of this product signifies your acceptance of the Terms of Use.