Modeling Filtering Predicates Composition with Finite State Automata

Authors:
Marco Leogrande;Luigi Ciminiera;Fulvio Risso
Affiliations:
-;-;-
Venue:
Proceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems
Year:
2011

Citing 5
Cited 0

BPF+: exploiting global data-flow optimization in a generalized packet filter architecture

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Profiling and Optimization of Software-Based Network-Analysis Applications

SBAC-PAD '03 Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
OpenFlow: enabling innovation in campus networks

ACM SIGCOMM Computer Communication Review
Swift: a fast dynamic packet filter

NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Network virtualization has gained a lot of attention recently, because of some new interesting proposals in the field (i.e. Open Flow). This trend has had the effect of pushing some filtering operations up at the software level: i.e. extract a potentially large number of protocol fields from a packet, or dynamically combine different filters. The time constraints of working at line rate force the creation of a packet filter model that can guarantee the minimum number of packet checks. This poster proposes mp FSA, a packet filter model based on the Finite State Automata formalism, that aims at achieving optimality w.r.t. the number of packet accesses, without sacrificing efficiency and scalability.