|
|
Performance Evaluation of DoS Resistant Proof-of-Stake Protocols
Ponek, Timotej ; Homoliak, Ivan (referee) ; Perešíni, Martin (advisor)
Táto práca je zameraná na vyhodnotenie Proof of Stake protokolov Algorand, LaKSA a COPOR z pohľadu vlastností kľúčových pre blockchainy. Dôraz je kladený na teoretickú analýzu protokolov z pohľadu bezpečnosti, výkonnosti a schopnosti vysporiadať sa s útokom typu DoS na lídrov, ktorý sú zodpovedný za tvorbu blokov v jednotlivých kolách. Jednotlivé protokoly boli implementované a rozšírené o anonymizačnú vrstvu pre zmarenie útokov typuDoS na lídra, a ich výkonnosť bola otestovaná. V neposlednom rade sme poukázali na ďalšímožný smer vývoja nového protokolu COPOR.
|
|
|
Control Flow Graph for P4 Programs
Ponek, Timotej ; Šišmiš, Lukáš (referee) ; Kekely, Lukáš (advisor)
Concept of SDN gradually became one of the most popular solutions for network management. It allows rapid reconfigurability of network devices, to reflect actual demands and to enable quick testing of new solutions, which supports overall advance in networking. This thesis focuses on P4 programming language, which is one of the implementations of SDN concept. The goal of this thesis is improvement of the existing open-source P4 compiler. More precisely, extension of a part used to generate control flow graphs. New implementation captures program flow even inside match-action tables and actions, which allows easier checking of compiler output and further optimization of compiler to reduce dead code. It also provides option to generate a fullgraph in dot format and a predefined json format that captures the flow of the program across all function blocks of the P4 program.
|
|
|
Control Flow Graph for P4 Programs
Ponek, Timotej ; Šišmiš, Lukáš (referee) ; Kekely, Lukáš (advisor)
Concept of SDN gradually became one of the most popular solutions for network management. It allows rapid reconfigurability of network devices, to reflect actual demands and to enable quick testing of new solutions, which supports overall advance in networking. This thesis focuses on P4 programming language, which is one of the implementations of SDN concept. The goal of this thesis is improvement of the existing open-source P4 compiler. More precisely, extension of a part used to generate control flow graphs. New implementation captures program flow even inside match-action tables and actions, which allows easier checking of compiler output and further optimization of compiler to reduce dead code. It also provides option to generate a fullgraph in dot format and a predefined json format that captures the flow of the program across all function blocks of the P4 program.
|
guest ::
