Storing Scheme for State Machine Based Rule Base of Genetic Feedback Algorithm Based Network Security Policy Framework Depending on Memory Consumption
Atish Mishra, Prakash Kumar · 2011
The work done hitherto suggests that the rule base of genetic feedback algorithm based network security framework can be represented using Finite State Machines. In this paper it is discussed how just by a simple modification in the storing scheme can reduce the worst case time complexity to be as low as 4 comparisons i.e. constant, for a FSM based rule base model. In this paper three types of storing schemes are discussed namely are, Time Efficient Storing which gives constant search time, second is Trade Off Storing in this scheme how a trade off can be done between space and time complexities to get a system according to availability of resources is discussed, time complexity for this scheme will be in the range of 2n , where n=2,3,…,10, and value of n is indirectly proportional to the space used and the third scheme is Space Efficient Storing, this scheme will give worst case complexity of 1024, but the space utilization is maximum for this scheme. In this paper a brief overview of arrays, linked list and arrays of linked list is given, and the various storing schemes are discussed in detail, with comparisons between them.