|
|
Mapping of Match Tables from P4 Language to FPGA Technology
Kekely, Michal ; Matoušek, Jiří (referee) ; Kořenek, Jan (advisor)
This thesis deals with design and implementation of mapping of match action tables from P4 language to FPGA technology. Goal of the thesis was to describe key principles, which need to be understood in order to design such a mapping and function of algorithms needed, apply these principles by implementing them and analyze the speed and memory requirements of such an implementation. Outcome provides configurable hardware unit capable of classifying packets and connection between the unit and match action tables from P4 language. The implementation is based on DCFL algorithm and requires less memory compared to HiCuts and HyperCuts algorithms while being comparably fast at worst-case scenarios.
|
|
|
Hash Function Design Using Genetic Programming
Michalisko, Tomáš ; Piňos, Michal (referee) ; Sekanina, Lukáš (advisor)
This thesis deals with automated design of hash functions using Cartesian genetic programming. The chosen method for collision resolution is cuckoo hashing. Three variants of hash function encodings were compared. Experiments were performed with datasets containing network flows. The most suitable parameters of CGP, including the function set, were determined. The best evolved hash functions achieved comparable results to the functions designed by experts. The main finding is that hash functions consisting of 64-bit operations achieve the best results.
|
|
|
Hash Function Design Using Genetic Programming
Michalisko, Tomáš ; Piňos, Michal (referee) ; Sekanina, Lukáš (advisor)
This thesis deals with automated design of hash functions using Cartesian genetic programming. The chosen method for collision resolution is cuckoo hashing. Three variants of hash function encodings were compared. Experiments were performed with datasets containing network flows. The most suitable parameters of CGP, including the function set, were determined. The best evolved hash functions achieved comparable results to the functions designed by experts. The main finding is that hash functions consisting of 64-bit operations achieve the best results.
|
|
|
Mapping of Match Tables from P4 Language to FPGA Technology
Kekely, Michal ; Matoušek, Jiří (referee) ; Kořenek, Jan (advisor)
This thesis deals with design and implementation of mapping of match action tables from P4 language to FPGA technology. Goal of the thesis was to describe key principles, which need to be understood in order to design such a mapping and function of algorithms needed, apply these principles by implementing them and analyze the speed and memory requirements of such an implementation. Outcome provides configurable hardware unit capable of classifying packets and connection between the unit and match action tables from P4 language. The implementation is based on DCFL algorithm and requires less memory compared to HiCuts and HyperCuts algorithms while being comparably fast at worst-case scenarios.
|
guest ::
