Evolutionary circuit design for fast FPGA-based classification of network application protocols

详细信息    查看全文

• 作者：D. Grochol ^{igrochol@fit.vutbr.cz" class="auth_mail" title="E-mail the corresponding author} ; L. Sekanina ; ^{sekanina@fit.vutbr.cz" class="auth_mail" title="E-mail the corresponding author} ; M. Zadnik ^{izadnik@fit.vutbr.cz" class="auth_mail" title="E-mail the corresponding author} ; J. Korenek ^{korenek@fit.vutbr.cz" class="auth_mail" title="E-mail the corresponding author} ; V. Kosar ^{ikosar@fit.vutbr.cz" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Application protocol ; Classifier ; Cartesian genetic programming ; Field programmable gate array
• 刊名：Applied Soft Computing
• 出版年：2016
• 出版时间：January 2016
• 年：2016
• 卷：38
• 期：Complete
• 页码：933-941
• 全文大小：855 K

文摘

The evolutionary design can produce fast and efficient implementations of digital circuits. It is shown in this paper how evolved circuits, optimized for the latency and area, can increase the throughput of a manually designed classifier of application protocols. The classifier is intended for high speed networks operating at 100 Gbps. Because a very low latency is the main design constraint, the classifier is constructed as a combinational circuit in a field programmable gate array (FPGA). The classification is performed using the first packet carrying the application payload. The improvements in latency (and area) obtained by Cartesian genetic programming are validated using a professional FPGA design tool. The quality of classification is evaluated by means of real network data. All results are compared with commonly used classifiers based on regular expressions describing application protocols.