A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
SPAF: Stateless FSA-Based Packet Filters
2011
IEEE/ACM Transactions on Networking
Preserved Fulltext
We propose a stateless packet filtering technique based on Finite-State Automata (FSA). ...
FSAs provide a comprehensive framework with well-defined composition operations that enable the generation of stateless filters from high-level specifications and their compilation into efficient executable ...
Torino, Dipartimento di Automatica e Informatica, e-mail: {pierluigi.rolando, riccardo.sisto, fulvio.risso}@polito.it This work has been partially supported by The Cisco University Research Program Fund, a ...
doi:10.1109/tnet.2010.2056698
fatcat:yyttbavdjbelpg5ohuzxdnwlre
A DFA with Extended Character-Set for Fast Deep Packet Inspection
2014
IEEE transactions on computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
We believe that DFA/EC will lay a groundwork for a new type of state compression technique in fast packet inspection. ...
Deep packet inspection (DPI), based on regular expressions, is expressive, compact, and efficient in specifying attack signatures. ...
Hardware-based approaches exploit parallelism and fast on-chip memory, and are able to create compact automata. ...
doi:10.1109/tc.2013.93
fatcat:w2no6svgsbgdlgpfq2qrb3j77i
A DFA with Extended Character-Set for Fast Deep Packet Inspection
2011
2011 International Conference on Parallel Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
We believe that DFA/EC will lay a groundwork for a new type of state compression technique in fast packet inspection. ...
Deep packet inspection (DPI), based on regular expressions, is expressive, compact, and efficient in specifying attack signatures. ...
Hardware-based approaches exploit parallelism and fast on-chip memory, and are able to create compact automata. ...
doi:10.1109/icpp.2011.75
dblp:conf/icpp/LiuCWW11
fatcat:hk6gcexygfguzhepzf2l4ntkuy
Deep network packet filter design for reconfigurable devices
2008
ACM Transactions on Embedded Computing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
It uses a list of signatures to scan the entire content of the packet; providing the means to filter harmful packets out of the network. ...
The smallest full pattern matcher implementation for the latest Snort NIDS fits in a single 400k Xilinx FPGA (Spartan 3 -XC3S400) with a sustained throughput of 1.6 Gbps. ...
Moscola and Lockwood translated regular expressions into deterministic finite automata (DFA) showing that, most DFAs can be reduced to a fast and compact circuit ]. ...
doi:10.1145/1331331.1331345
fatcat:qnqk4vsa6ffxncryxt57fkg34i
An improved DFA for fast regular expression matching
2008
Computer communication review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
requires a transition per character only, thus allowing fast matching. ...
Moreover, a new state encoding scheme is proposed and the comprehensive algorithm is tested for use in the packet classification area. ...
Finally we would like to express gratitude to Haoyu Song for his freely available packet classifier implementations that helped us in our work and to the anonymous reviewers for their insightful comments ...
doi:10.1145/1452335.1452339
fatcat:boddzlhjgbgkba4a6zhvvy2zqi
A fast compiler for NetKAT
2015
Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming - ICFP 2015
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Other Versions
This paper presents a new compiler for the NetKAT language that handles rich features including regular paths and virtual networks, and yet is several orders of magnitude faster than previous compilers ...
High-level programming languages play a key role in a growing number of networking platforms, streamlining application development and enabling precise formal reasoning about network behavior. ...
dst=A to a flow table with two rules: the first matches packets where dst=A and leaves them unchanged and the second matches all other packets and drops them (Figure 2 (b) ). ...
doi:10.1145/2784731.2784761
dblp:conf/icfp/SmolkaEFG15
fatcat:q2tv34ihvffylevwtnijha5xne
Named data networking on a router: Fast and DoS-resistant forwarding with hash tables
2013
Architectures for Networking and Communications Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Implementation of scalable NDN packet forwarding remains a challenge because NDN requires fast variable-length hierarchical name-based lookup, per-packet data plane state update, and large-scale forwarding ...
In this paper, we review various design options for a hash tablebased NDN forwarding engine and propose a design that enables fast forwarding while achieving DoS (Denial-of-Service) resistance. ...
Based on lessons learned from those designs, we have applied 2 techniques for fast packet input and output in our system. ...
doi:10.1109/ancs.2013.6665203
dblp:conf/ancs/SoNO13
fatcat:cuymsgphdfcynpa3owfhko5ima
A fast compiler for NetKAT
2015
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
This paper presents a new compiler for the NetKAT language that handles rich features including regular paths and virtual networks, and yet is several orders of magnitude faster than previous compilers ...
High-level programming languages play a key role in a growing number of networking platforms, streamlining application development and enabling precise formal reasoning about network behavior. ...
dst=A to a flow table with two rules: the first matches packets where dst=A and leaves them unchanged and the second matches all other packets and drops them (Figure 2 (b) ). ...
doi:10.1145/2858949.2784761
fatcat:sg7dou6cajdjjg3nmpfbsfenjq
Bypassing Space Explosion in High-Speed Regular Expression Matching
2014
IEEE/ACM Transactions on Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The key to our approach is a spaceand time-efficient routine for merging two compact D FA into a compact D FA. ...
Index Terms-Deep packet inspection, information security, intrusion detection and prevention, network security, regular expression matching. 1063-6692 ...
Finally, while we focus on D FA in this paper, we believe that our techniques can be generalized to other compact RE matching automata solutions [11] - [15] .
B. ...
doi:10.1109/tnet.2014.2309014
fatcat:vmbu6jwbkzcrvfl35aho7g6h4i
Algorithms to accelerate multiple regular expressions matching for deep packet inspection
2006
Computer communication review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. ...
Most high performance systems that perform deep packet inspection implement simple string matching algorithms to match packets against a large, but finite set of strings. ...
packet can match to). ...
doi:10.1145/1151659.1159952
fatcat:vkslf3jsurcqja2k6ga7gxr3qu
Algorithms to accelerate multiple regular expressions matching for deep packet inspection
2006
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications - SIGCOMM '06
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. ...
Most high performance systems that perform deep packet inspection implement simple string matching algorithms to match packets against a large, but finite set of strings. ...
packet can match to). ...
doi:10.1145/1159913.1159952
dblp:conf/sigcomm/KumarDYCT06
fatcat:ahhkingbyjczvop3uskldtryqq
Fast Deep Packet Inspection with a Dual Finite Automata
2013
IEEE transactions on computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Deep packet inspection, in which packet payloads are matched against a large set of patterns, is an important algorithm in many networking applications. ...
In this paper, we propose and evaluate a dual Finite Automaton (dual FA) to address these shortcomings. ...
INTRODUCTION Deep packet inspection, in which packet payloads are matched against a large set of patterns, is an important algorithm in many networking applications. ...
doi:10.1109/tc.2011.231
fatcat:wiyoiesurzg3nnvk32he6m7soy
Fast Regular Expression Matching Using Small TCAM
2014
IEEE/ACM Transactions on Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Regular expression (RE) matching is a core component of deep packet inspection in modern networking and security devices. ...
We tested our techniques on eight real-world RE sets, and our results show that small TCAMs can be used to store large deterministic finite automata (DFAs) and achieve potentially high RE matching throughput ...
While we have only applied our techniques to DFAs in this initial study of TCAM-based RE matching, our techniques may work very well with scratch memory-based automata. ...
doi:10.1109/tnet.2013.2256466
fatcat:abvllhjfnnacfo7jbkys6xvijq
Modern ağ trafiği analizi için derin paket incelemesi hakkında kapsamlı bir çalışma: sorunlar ve zorluklar
A comprehensive survey on deep packet inspection for advanced network traffic analysis: issues and challenges
2022
Ömer Halisdemir Üniversitesi Mühendislik Bilimleri Dergisi
A comprehensive survey on deep packet inspection for advanced network traffic analysis: issues and challenges
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Deep Packet Inspection (DPI) provides full visibility into network traffic by performing detailed analysis on both packet header and packet payload. ...
as a component of the hybrid system, are examined. ...
In this direction, suggested methods for avoiding or mitigating state explosion have been examined, and these suggestions are presented for the creation of compact and efficient automata. ...
doi:10.28948/ngumuh.1184020
fatcat:4fny6rlz2beazntn7hvfyk2v4y
Automata Processor Architecture and Applications: A Survey
2016
International Journal of Grid and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
One such technology is the recently introduced Micron Automata Processor (AP), which is a novel and powerful reconfigurable non-von Neumann processor that can be used for direct implementation of multiple ...
Finite automata-based algorithms are becoming increasingly important for a wide range of application domains to process large volumes of unstructured data. ...
Nondeterministic Finite Automata (NFA) is a useful formalism for pattern identification problems that have a large amount of conditional branching such as bioinformatics, text-retrieval, and search engine ...
doi:10.14257/ijgdc.2016.9.4.05
fatcat:stay6tyhrzgdhfn4ptnv56oxq4
« Previous
Showing results 1 — 15 out of 462 results