Efficient multistriding of large non-deterministic finite state automata for deep packet inspection

Avalle, Matteo; Risso, Fulvio; Sisto, Riccardo

doi:10.1109/icc.2012.6364235

Cited by 3 publications

(3 citation statements)

References 6 publications

(23 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Reference [5] also presented the extension of these algorithms to NFA. Another algorithm for NFA stride doubling with similar complexity but without alphabet compression was presented in [6], while in [7] we showed our preliminary results toward more scalable algorithms for multi-striding.…”

Section: Related Workmentioning

confidence: 95%

Scalable Algorithms for NFA Multi-Striding and NFA-Based Deep Packet Inspection on GPUs

Avalle

Risso

Sisto

2016

IEEE/ACM Trans. Networking

Self Cite

View full text Add to dashboard Cite

Finite state automata (FSA) are used by many network processing applications to match complex sets of regular expressions in network packets. In order to make FSA-based matching possible even at the ever-increasing speed of modern networks, multi-striding has been introduced. This technique increases input parallelism by transforming the classical FSA that consumes input byte by byte into an equivalent one that consumes input in larger units. However, the algorithms used today for this transformation are so complex that they often result unfeasible for large and complex rule sets. This paper presents a set of new algorithms that extend the applicability of multi-striding to complex rule sets. These algorithms can transform nondeterministic finite automata (NFA) into their multi-stride form with reduced memory and time requirements. Moreover, they exploit the massive parallelism of graphical processing units for NFA-based matching. The final result is a boost of the overall processing speed on typical regex-based packet processing applications, with a speedup of almost one order of magnitude compared to the current state-of-the-art algorithms.

show abstract

Section: Related Workmentioning

confidence: 95%

Scalable Algorithms for NFA Multi-Striding and NFA-Based Deep Packet Inspection on GPUs

Avalle

Risso

Sisto

2016

IEEE/ACM Trans. Networking

Self Cite

View full text Add to dashboard Cite

show abstract

“…The experimental result of the proposed approach proves that it was able to reduce the state access in a DFA in proportion to the traffic's compression ratio. Matteo Avalle et al (2012) proposed a new algorithm to build mulitstride NFA for inspecting packet with reasonable memory and time.…”

Section: Automata-based Ids and Routing In Wsnmentioning

confidence: 99%

Computational intelligence paradigms for automata based secured energy efficient routing in wireless sensor network - A technical survey

Prithi¹,

Sumathi²

2023

Int. J. Eng. Sci. Tech

View full text Add to dashboard Cite

Wireless Sensor Network (WSN) has been deployed in several areas of interest for controlling the region, automation of mundane tasks due to features such as smart sensor nodes, low cost, and small-scale factors. Earlier, the sensory units were costly and deficient in the computational and communicational capabilities which were overcome by sensing, processing, storing, and forwarding the data powered by a battery. There predominates diverse applications which affects the low-cost solutions of WSNs in numerous specialties such as observing patients in health care, target exposure, and tracking purposes, examining the atmosphere and climate, home applications, contributing protection for vehicular networks Owing to the diversity of the applications of Wireless Sensor Network, it needs to impose varying design, implementation, and performance requirements on the Wireless Sensor Network to have deep knowledge about the characteristics of WSNs. The pervasiveness of designing and optimizing WSN appeared to be a surplus to several application fields which influenced countless researchers to pay attention to several issues such as routing, mobility of nodes, coverage, and security. In recent years, designing of WSN becomes the leading domain for many researchers. A WSN is bounded with a collection of devices that are associated in the network to communicate the information collected from the field through the wireless links that have been established in the network. The data thus collected is transmitted through multiple nodes and also, the data is communicated to other networks through the gateway. During the design and deployment of WSNs, more attention is required at various levels like routing, coverage, and security. A complete system could be designed so that it could resolve the problems such as energy exhaustion, network lifetime, throughput, end-to-end time, routing, and intrusion detection could also monitor and keep control of the network environment. Therefore, this proposed technical research survey work has been carried out by devising an automaton system that can learn, monitor and control the dynamic behaviour of the network environment as well as can obtain an optimal route using Computational Intelligence Techniques. Besides, it detects the malicious activities that occur in the network using Hybrid Intrusion Detection System (IDS) model to enhance the throughput, lifetime of the network, utilization of the energy, end-to-end delay, accuracy, detection rate, computational time and recall rate.

show abstract

“…The NFA corresponding to the regular expression is constructed by the partial NFA of each sub expression, which uses different construction methods for different operators, which uses different construction methods for different operators [9,10]. Part of the NFA does not match the state; instead, they have one or more of the arrow pointing to the null.…”

Section: The Principle Of Regular Expressionmentioning

confidence: 99%

Research on Network Intrusion Detection Method based on Regular Expression Matching

Wang¹

2016

IJSIA

View full text Add to dashboard Cite

show abstract

Efficient multistriding of large non-deterministic finite state automata for deep packet inspection

Cited by 3 publications

References 6 publications

Scalable Algorithms for NFA Multi-Striding and NFA-Based Deep Packet Inspection on GPUs

Scalable Algorithms for NFA Multi-Striding and NFA-Based Deep Packet Inspection on GPUs

Computational intelligence paradigms for automata based secured energy efficient routing in wireless sensor network - A technical survey

Research on Network Intrusion Detection Method based on Regular Expression Matching

Contact Info

Product

Resources

About