|
|
Acceleration of LZ4 Compression Algorithm in FPGA
Marton, Dominik ; Martínek, Tomáš (referee) ; Matoušek, Jiří (advisor)
This project describes the implementation of an LZ4 compression algorithm in a C/C++-like language, that can be used to generate VHDL programs for FPGA integrated circuits embedded in accelerated network interface controllers (NICs). Based on the algorithm specification, software versions of LZ4 compressor and decompressor are implemented, which are then transformed into a synthesizable language, that is then used to generate fully functional VHDL code for both components. Execution time and compression ratio of all implementations are then compared. The project also serves as a demonstration of usability and influence of high-level synthesis and high-level approach to design and implementation of hardware applications known from common programming languages.
|
|
|
Analysis of Parameters of Packet Classification Rule Sets
Sabo, Jozef ; Orsák, Michal (referee) ; Matoušek, Jiří (advisor)
A theme of bachelor's thesis is an analysis of rules used for packet classification in computer networks. A theoretical part of the thesis introduces packet classification and describes the role of classification rules. This part also presents the format of classification rules utilized in real tools. Based on these information, a tool able to analyze IP 5-tuple classification rules in any format was designed and implemented. Output of the implemented tool is a parameter file containing different statistics and probability distributions of examined rule sets. This parameter file can be used for generating synthetic rule sets using ClassBench and ClassBench-ng tools. The final part of the thesis examines parameter files created by the implemented tool from available real rule sets.
|
|
|
Financing Projects from EU Funds
Procházková, Jana ; Matoušek, Jiří (referee) ; Heralecký, Tomáš (advisor)
Thesis addresses the issue of funding the European Union, notably through the State Agricultural Intervention Fund in Agrospol Hradek, spol. s r.o. The work builds on the current situation in society, the attention is focused on project financing irrigation pumping station on the water "Rajčatovna". In other parts of the work is submitted by a means of financing the project.
|
|
|
Measurement of Backbone Routing Parameters
Celárek, Ondřej ; Kořenek, Jan (referee) ; Matoušek, Jiří (advisor)
This thesis deals with issue of routing between Autonomous Systems. For routing between autonomous systems is used Border Gateway Protocol (BGP). The routers in Autonomous Systems modify their routing tables based on BGP messages. Routing tables are used for forwarding information on Internet. Issue of this thesis is analysis of change routing tables for eventually optimizing of routing architecture. First part of thesis is focused on theory of routers, routing ang BGP. Second part of this thesis focuses on implementation and execution experiments with routing tables. In this part are also described reached results.
|
|
|
Network Traffic Monitoring Using the P4 Language
Patová, Pavlína ; Matoušek, Jiří (referee) ; Martínek, Tomáš (advisor)
Today we often encounter the need to monitor network and service quality. For this purpose we can use for example INT. Our goal is to find the optimal platform and associated compiler for implementing INT. We will try to find an alternative to the existing solutions (T4P4S, BMv2). However, we will also mention these two platforms and discuss their advantages and disadvantages. The result of this work is an overview of the capabilities of each compiler and the performance of the described implementations.
|
|
|
Longest Prefix Match Algorithms
Sedlář, František ; Matoušek, Jiří (referee) ; Tobola, Jiří (advisor)
This master's thesis explains basics of the longest prefix match (LPM) problem. It analyzes and describes chosen LPM algorithms considering their speed, memory requirements and an ability to implement them in hardware. On the basis of former findings it proposes a new algorithm Generic Hash Tree Bitmap. It is much faster than many other approaches, while its memory requirements are even lower. An implementation of the proposed algorithm has become a part of the Netbench library.
|
|
|
Computer modelling of mixture formulas of composite materials
Matoušek, Jiří ; Frk, Martin (referee) ; Rozsívalová, Zdenka (advisor)
Submitted work engage in modelling of progressions of dielectric variables and aplication of mixture formulas for solution of composite materials in dependency on frequency. Theoretical part engage in theory of dielectric materials and composite materials and contains summary of basic mixture formulas. A part of work is programm which can be used in education. It allows modelling of permitivity, loss factor and loss number in dependency on frequency and Cole-Cole circle diagram in materials. In mixtures modelling of Maxwell´s, Bőttcher´s and Lichtenecker´s mixture formulas.
|
|
|
Packet Filtration in 100 Gb Networks
Kučera, Jan ; Matoušek, Jiří (referee) ; Kořenek, Jan (advisor)
This master's thesis deals with the design and implementation of an algorithm for high-speed network packet filtering. The main goal was to provide hardware architecture, which would support large rule sets and could be used in 100 Gbps networks. The system has been designed with respect to the implementation on an FPGA card and time-space complexity trade-off. Properties of the system have been evaluated using various available rule sets. Due to the highly optimized and deep pipelined architecture it was possible to reach high working frequency (above 220 MHz) together with considerable memory reduction (on average about 72% for compared algorithms). It is also possible to efficiently store up to five thousands of filtering rules on an FPGA with only 8% of on-chip memory utilization. The architecture allows high-speed network packet filtering at wire-speed of 100 Gbps.
|
|
|
Network Traffic Generator for Testing of Packet Classification Algorithms
Janeček, David ; Orsák, Michal (referee) ; Matoušek, Jiří (advisor)
Pokrok při zdokonalování klasifikačních algoritmů je zpomalován nedostatkem dat potřebných pro testování. Reálná data je obtížné získat z důvodu bezpečnosti a ochrany citlivých informací. Existují však generátory syntetických sad pravidel, jako například ClassBench-ng. K vyhodnocení správného fungování, propustnosti, spotřeby energie a dalších vlastností klasifikačních algoritmů je zapotřebí také vhodný síťový provoz. Tématem této práce je tvorba takového generátoru síťového provozu, který by umožnil testování těchto vlastností v kombinaci s IPv4, IPv6 a OpenFlow1.0 pravidly vygenerovanými ClassBench-ng. Práce se zabývá různými způsoby, jak toho dosáhnout, které vedly k vytvoření několika verzí generátoru. Vlastnosti jednotlivých verzí byly zkoumány řadou experimentů. Implementace byla provedena pomocí jazyku Python. Nejvýznamnějším výsledkem je generátor, který využívá principů několika zkoumaných přístupů k dosažení co nejlepších vlastností. Dalším přínosem je nástroj, který bylo nutné vytvořit pro analýzu užitých sad klasifikačních pravidel a vyhodnocení vlastností vygenerovaného síťového provozu.
|
|
|
High-Speed Packet DMA Transfers from FPGA
Kubálek, Jan ; Matoušek, Jiří (referee) ; Kořenek, Jan (advisor)
Computer network devices that implement data-flow monitoring to allow network manage-ment require a high-speed receiving of a large amount of data for analysis. For a deviceto enable the monitoring of a network with high data traffic, its network interface cardneeds to be capable of transferring received data to a RAM at high speed. A new mo-dule for an FPGA chip on a network interface card, which can control these transfers, wasdesigned, implemented and tested in the course of this thesis. The created module sup-ports transfer of packets from the FPGA to the computer's memory via a PCI-Express busat the speed of 100 Gb/s and 200 Gb/s. Packets are transferred by DMA in system DPDK.
|
guest ::
