Gossip Algorithms and Applications

Student: Sokolova Svetlana

Faculty: Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod)

Educational Programme: Applied Mathematics and Information Science (Bachelor)

Final Grade: 9

Year of Graduation: 2020

In the 20th century the development of “new generation” networks required new algorithms for fast and efficient computing in large networks with respect to the properties of the network topology. These algorithms are called gossip algorithms, which unite a whole family of algorithms for solving various problems in networks with certain properties. The work analyzed the algorithms presented in the article “Accelerated Gossip in Networks of Given Dimension using Jacobi Polynomial Iterations” of calculation the average values in the network based on the transition gossip matrix. Experiments were conducted on different graph structures (regular, random, and cluster) and for each topology the optimal parameters of the algorithms were selected that significantly increased their efficiency.

Full text (added May 25, 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