Optimizing trust in networks through exchange of message paths

Bachelor thesis (2022)

Authors

L. Dubravica Electrical Engineering, Mathematics and Computer Science

Contributors

B.A. Cox Data-Intensive Systems - EEMCS (mentor)
Jérémie Decouchant Data-Intensive Systems - EEMCS (mentor)
Rafael Bidarra Computer Graphics and Visualisation - EEMCS (graduation committee member)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
Copyright: © 2022 Luka Dubravica
More Info
expand_more

Published Date

23-06-2022

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

Distributed systems are networks of nodes depending on each other. However, each network can have multiple faulty nodes, which are either malfunctioning or malicious. Bracha's algorithm allows correct nodes inside the network to agree on certain information, while tolerating a certain amount of faulty nodes. Nodes exchange Send, Echo and Ready message types to inform each other of receiving the message and agreeing on its trustworthiness. The focus of this paper is to present the functional differences of exchanging message paths that messages have crossed instead of the message types. In conclusion, the BMP algorithm showed potential to outperform original Bracha's algorithm in two general cases: networks that have a low probability of successfully transmitting a message, and networks where nodes have a system of trust established which allows them to determine trustworthiness of other nodes. Otherwise, in general usage, original Bracha's algorithms appears to be superior in comparison to the BMP algorithm.