DocumentCode :
2127142
Title :
Modeling filtering predicates composition with Finite State Automata
Author :
Leogrande, Marco ; Ciminiera, Luigi ; Risso, Fulvio
Author_Institution :
Dipt. di Autom. e Inf., Politec. di Torino, Torino, Italy
fYear :
2011
fDate :
15-17 Sept. 2011
Firstpage :
1
Lastpage :
5
Abstract :
Designing an efficient and scalable packet filter for modern computer networks becomes each day more challenging: the increased data rate and a much higher number of active hosts make filtering expressions more complex than in the past, noticeably stressing the filtering systems. Some architectures focus on the most used filtering patterns and predicates, but must use a slower fallback if filtering on “less used” ones; dynamic code generation systems implement complex optimizations, but these compiler-oriented algorithms focus only on the final code, where most of the protocol abstraction is lost. This paper presents mpFSA, a novel packet filter model based on the Finite State Automata formalism to guarantee optimality w.r.t. the number of packet accesses, that aims at allowing powerful optimizations without sacrificing efficiency and scalability.
Keywords :
automata theory; computer networks; filtering theory; finite state machines; compiler-oriented algorithms; dynamic code generation systems; filtering expressions; filtering patterns; filtering systems; finite state automata; modeling filtering predicates composition; modern computer networks; packet filter model; protocol abstraction;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Software, Telecommunications and Computer Networks (SoftCOM), 2011 19th International Conference on
Conference_Location :
Split
Print_ISBN :
978-1-4577-1439-9
Type :
conf
Filename :
6064389
Link To Document :
بازگشت