Defesa de Doutorado – Ray Willy Neiheiser – 29/3/2022
22/03/2022 14:04
| Defesa de Tese de Doutorado | |
| Aluno | Ray Willy Neiheiser |
| Orientador
Coorientador |
Prof. Carlos Barros Montez, Dr. – DAS/UFSC
Prof. Luís Rodrigues, Dr. – IST/Ulisboa |
| Data
|
29/3/2022 13h (terça-feira)
Videoconferência (https://videoconf-colibri.zoom.us/j/81303473692?pwd=L1dYK3ZmUWNaRUROaWNPSGZvUHdwUT09) Senha para acesso na sala: 576278 |
|
Banca |
Prof. Carlos Barros Montez, Dr. – DAS/UFSC (presidente);
Prof. Fabíola Greve, Dr. – PGCOMP/UFBA; Prof. Rodrigo Rodrigues, Dr. – DEI/ULisboa; Prof. Ittai Abraham, Dr. – CS/Huji; Prof. Miguel Correia, Dr. – DEI/ULisboa; Prof. Jean E. Martina, Dr. – PPGCC/UFSC. |
| Título | Scalable and Resilient Byzantine Fault Tolerant Consensus |
| Abstract: The increasing popularity of blockchains in addressing an expanding set of use cases, from enterprise to governmental applications, led to a growing interest in permissioned blockchains. In contrast to their permissionless counterparts, permissioned blockchains can ensure deterministic transaction finality which is a key requirement in many settings and can offer high throughput in small-sized systems. Some emerging use cases for permissioned blockchains require the system to scale to hundreds of participants. However, most permissioned blockchains are based on variants of classical byzantine fault-tolerant (BFT) consensus protocols that scale poorly with the number of participants. Such scalability limitations stem from bottlenecks both at the network and processing levels that result from the large number of messages that need to be sent, received and processed to reach consensus. Most attempts to solve this problem on a large scale end up reducing the overall resilience of the system and endanger both safety and liveness in the presence of byzantine failures. An approach that distributes the load equally among a set of processes are tree-based algorithms. However, due to the additional communication steps, tree-based approaches still display insufficient throughput on a geographic scale. Tree structures are also inherently more sensitive to byzantine faults, and constructing robust trees in the presence of failures is not a trivial matter. This thesis proposes new techniques that address these problems. We leverage extensive pipelining to achieve high throughput on a geographic scale independently of the depth of the tree and present a reconfiguration algorithm that is able to construct a robust tree in optimal steps in the presence of failures. Experimental results show that \thesystem, a prototype that incorporates the proposed techniques, can efficiently execute consensus in settings with more than 500 participants and can achieve up to over 58 times the throughput of competing approaches. | |
