By Topic

Designing Rule Base for Genetic Feedback Algorithm Based Network Security Policy Framework Using State Machine

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Atish Mishra ; Comput. Sci. & Eng., JIIT, Noida, India ; Arun Kumar Jhapate ; Prakash Kumar

A genetic algorithm based policy management system judges the validity of network events according to the rules defined in the rule base. These rules are either IP addresses or combination of IP address and some other parameters, such as port numbers etc. This paper discusses the design and benefits of rule base which is based on finite state machines. Since whenever a new network event comes, the process of judging the event should be less time consuming. This could be done by making the rule base efficient in terms of searching of rules. One of the way of doing so is using FSMpsilas. For a table having 232 (approx) entries, the searching time for a FSM based system is calculated mathematically to be 210 (approx), and the time complexity for same number of entries for a linear searching system will be 232 (approx) . In this paper a brief overview of finite state machines is presented. The proposed design of rule base is discussed in detail with its advantages.

Published in:

2009 International Conference on Signal Processing Systems

Date of Conference:

15-17 May 2009