Spreading Information in Distributed Systems Using Gossip Algorithm

Abstract

In the following article problem of an information sharing in the distributed system is described. Ways of solving that problem with emphasize on Gossip protocol are presented. The main goal of the article is to examine and analyze the operation of Gossip algorithm, taking into consideration chosen mode and values of parameters. In the beginning, problem of exchanging information in the distributed system is presented and different algorithms solving it were shown. Afterward, Gossip algorithm is presented. The principle of its operation, its working modes and models in which Gossip algorithm can work are described. As part of the article, an application in C# language was made, allowing to examine Gossip protocol in the laboratory environment. The laboratory environment contained minimum of six and a maximum of ten nodes. Number of iterations needed to achieve consistency for six, eight and ten connected computers was examined. Research was made for deferent working modes of Gossip protocol. To present operation and scalability of Gossip algorithm, the mathematical model of the algorithm and graph presenting percentage of infected nodes in individual iterations, is shown. In order to describe Gossip algorithm using a mathematical formula, a model known from epidemiology was used. At the end analysis of research’s results was done. As well problems related to the Gossip algorithm and the method for solving them were described. The application of Gossip algorithm in commercial solutions was also presented.