Public Review for An Improved DFA for Fast Regular Expression Matching Domenico Ficara, Stefano Giordano, Gregorio Procissi, Fabio Vitucci, Gianni Antichi, and Andrea Di Pietro Traffic classification and application identification are important functions in network administration. Traditionally, this was always done by using the port number in the transport header, but with the emerging of new applications using non standard port numbers, there is a need for another more general method. And even for legacy applications, there is a need to control the traffic to check whether it contains any harmful code as a virus or a worm. The most common approach to counter these two problems is to rely on deep packet inspection. Each undesirable (or even desirable) event is characterized by some series of characters, then the payload of packets is browsed for these specific strings seen as fingerprints of events. This method is largely used by today intrusion detection systems. The main problem with it is in the cost of browsing the memory to interpret the content of the payload and to check whether it contains some specific fingerprints or not. This is made more complex by the large number of fingerprints that exist. To
End of preview. The entire article is 11 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/an-improved-dfa-for-fast-regular-expression-matching-gqFNUnvzVs
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
An improved DFA for fast regular expression matching
Ficara, Domenico; Giordano, Stefano; Procissi, Gregorio; Vitucci, Fabio; Antichi, Gianni; Di Pietro, Andrea
Follow ACM SIGCOMM Computer Communication Review
, Volume 38 (5)
Association for Computing Machinery – Sep 30, 2008
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
