Discovering the Topology in an Unknown Network

Bachelor thesis (2022)

Authors

S.C. Mărîi 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 Silviu Mărîi
More Info
expand_more

Published Date

22-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

Discovering the topology in an unknown network is a fundamental problem for the distributed systems that faces several backlashes due to the proneness of such systems to Byzantine (i.e. arbitrary or malicious) failures. During the past decades, several protocols were developed to allow a network to be resilient up to a certain number of Byzantine processes and guarantee a reliable communication between the correct processes. However, they still suffer from high complexity or unrealistic assumptions which makes them impractical. In this paper modifications made to one of the current state-of-art protocols are presented, modifications that can potentially reduce the load of the network and improve the Reliable Communication layer. We employ empirical analysis in order to prove that reliable communication can still be achieved with these modifications in place and to measure the performance. The findings of this study show that our improved protocol has a reduction of 18.38% in the number of exchanged messages.

Files

Final_Paper_7.pdf
(pdf | 0.378 Mb)