Performance Analysis for Consensus Algorithms in Networks with Failures

Student: Kudriavtcev Artem

Faculty: HSE Tikhonov Moscow Institute of Electronics and Mathematics (MIEM HSE)

Educational Programme: Control Systems and Data Processing in Engineering (Master)

Final Grade: 9

Year of Graduation: 2020

This paper studies the mathematical models of multi-agent networks consisting of an exact time server, special (boundary) nodes, and nodes of the internal network. Network nodes are unreliable. It means that with some probability a node may breakdown. The main goal is to identify effective data matching algorithms. In addition, one of the tasks is to build a simulation model of the system. The paper evaluates the effectiveness of matching algorithms for various models of multi-agent networks. The Python programming language was used for computer modeling and visualization of results. The total amount of work is 64 pages.

Full text (added May 24, 2020)

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses