<efrbr:recordSet xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:efrbr="http://vfrbr.info/efrbr/1.1" xmlns:efrbr-work="http://vfrbr.info/efrbr/1.1/work" xmlns:efrbr-expression="http://vfrbr.info/efrbr/1.1/expression" xmlns:efrbr-manifestation="http://vfrbr.info/efrbr/1.1/manifestation" xmlns:efrbr-person="http://vfrbr.info/efrbr/1.1/person" xmlns:efrbr-corporateBody="http://vfrbr.info/efrbr/1.1/corporateBody" xmlns:efrbr-concept="http://vfrbr.info/efrbr/1.1/concept" xmlns:efrbr-structure="http://vfrbr.info/efrbr/1.1/structure" xmlns:efrbr-responsible="http://vfrbr.info/efrbr/1.1/responsible" xmlns:efrbr-subject="http://vfrbr.info/efrbr/1.1/subject" xmlns:efrbr-other="http://vfrbr.info/efrbr/1.1/other" xsi:schemaLocation="http://vfrbr.info/efrbr/1.1 http://vfrbr.info/schemas/1.1/efrbr.xsd"><efrbr:entities><efrbr-work:work identifier="http://purl.tuc.gr/dl/dias/C6C06D61-B760-4357-B36D-BF1974B21093"><efrbr-work:titleOfTheWork>Fast, large-scale string match for a 10Gbps FPGA-based network intrusion Detection system</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/C6C06D61-B760-4357-B36D-BF1974B21093"><efrbr-expression:titleOfTheExpression>Fast, large-scale string match for a 10Gbps FPGA-based network intrusion Detection system</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Πλήρης Δημοσίευση σε Συνέδριο
            Conference Full Paper
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2015-10-19</efrbr-expression:dateOfExpression><efrbr-expression:dateOfExpression type="published">2003</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent>Intrusion Detection Systems such as Snort scan incoming packets for evidence of security threats. The most computation-intensive part of these systems is a text search against hundreds of patterns, and must be performed at wire-speed. FPGAs are particularly well suited for this task and several such systems have been proposed. In this paper we expand on previous work, in order to achieve and exceed a processing bandwidth of 11Gbps. We employ a scalable, low-latency architecture, and use extensive fine-grain pipelining to tackle the fan-out, match, and encode bottlenecks and achieve operating frequencies in excess of 340MHz for fast Virtex devices. To increase throughput, we use multiple comparators and allow for parallel matching of multiple search strings. We evaluate the area and latency cost of our approach and find that the match cost per search pattern character is between 4 and 5 logic cells.</efrbr-expression:summarizationOfContent><efrbr-expression:useRestrictionsOnTheExpression type="creative-commons">http://creativecommons.org/licenses/by/4.0/</efrbr-expression:useRestrictionsOnTheExpression><efrbr-expression:note type="page range">880-889</efrbr-expression:note><efrbr-expression:note type="conference name">13th International Conference on Field Programmable Logic and Applications</efrbr-expression:note></efrbr-expression:expression><efrbr-person:person identifier="http://users.isc.tuc.gr/~dpnevmatikatos"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Pnevmatikatos Dionysios
            Πνευματικατος Διονυσιος
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="9FF7AE35-1BCE-47C9-B53B-7E7BD3134546"><efrbr-person:nameOfPerson vocabulary="">
            Ioannis Sourdis
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-corporateBody:corporateBody identifier="http://www.springerlink.com/?MUD=MP"><efrbr-corporateBody:nameOfTheCorporateBody vocabulary="S/R:PUBLISHERS">
            Springer Verlag
         </efrbr-corporateBody:nameOfTheCorporateBody></efrbr-corporateBody:corporateBody><efrbr-concept:concept identifier="http://id.loc.gov/authorities/subjects/sh2006002867"><efrbr-concept:termForTheConcept>
            Monitoring of computer networks
            Network monitoring (Computer networks)
            computer networks monitoring
            monitoring of computer networks
            network monitoring computer networks
         </efrbr-concept:termForTheConcept></efrbr-concept:concept></efrbr:entities><efrbr:relationships><efrbr-structure:structureRelations><efrbr-structure:realizedThrough sourceEntity="work" targetEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/C6C06D61-B760-4357-B36D-BF1974B21093" targetURI="http://purl.tuc.gr/dl/dias/C6C06D61-B760-4357-B36D-BF1974B21093"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/C6C06D61-B760-4357-B36D-BF1974B21093" targetURI="http://users.isc.tuc.gr/~dpnevmatikatos"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/C6C06D61-B760-4357-B36D-BF1974B21093" targetURI="http://users.isc.tuc.gr/~dpnevmatikatos"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/C6C06D61-B760-4357-B36D-BF1974B21093" targetURI="9FF7AE35-1BCE-47C9-B53B-7E7BD3134546"/><efrbr-responsible:realizedBy sourceEntity="expression" role="publisher" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/C6C06D61-B760-4357-B36D-BF1974B21093" targetURI="http://www.springerlink.com/?MUD=MP"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations><efrbr-subject:hasSubject sourceEntity="work" targetEntity="concept" sourceURI="http://purl.tuc.gr/dl/dias/C6C06D61-B760-4357-B36D-BF1974B21093" targetURI="http://id.loc.gov/authorities/subjects/sh2006002867"/></efrbr-subject:subjectRelations><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>