No abstract

The vast majority of the system security application in today's systems depend on deep packet inspection. In recent years, regular expression matching has been used as an important operator that examines whether or not the packet's payload can be matched with a group of predefined regular expression. Regular expressions are parsed using the deterministic finite automata representations. Conversely, to represent regular expression sets as DFA, the system needs large amount of memory, an excessive amount of time, or an excessive amount of per flow state limiting their practical applications. In this chapter, the intelligent optimization grouping algorithms (IOGA) are discussed to resolve the state blow up problem. As a result of using IOGA, the system provides memory-efficient automata by dispensing the regular expression sets in various groups and optimizing the DFAs.

With the rise of user based on distributed network system, traffic congestion is one of the unavoidable situations. Distributed network consists of various networks, processors and intermediary devices that overload the switches or routers with high traffic and it is because of the design fault in the distributed networking architecture. Even though several researchers address the congestion detection technique, its avoidance and mitigation in their research are hard to be explored for any effective solution for this problem. This paper investigates the work being carried out in the recent past for finding an effective solution to this serious problem. In addition to that the study also proposes an idea of cross layer technique that can be adopted to have an effective control on congestion in distributed networks.

No abstract

No abstract