Searched for: subject%3A%22gossip%255C+algorithms%22
(1 - 3 of 3)
Van de Bovenkamp, R. (author)
Local interactions on a graph will lead to global dynamic behaviour. In this thesis we focus on two types of dynamic processes on graphs: the Susceptible-Infected-Susceptilbe (SIS) virus spreading model, and gossip style epidemic algorithms. The largest part of this thesis is devoted to the SIS model. We first introduce the SIS model in chapter...
doctoral thesis 2015
Pruteanu, A.S. (author)
Software applications developed for large-scale systems have always been difficult to de- velop due to problems caused by the large number of computing devices involved. Above a certain network size (roughly one hundred), necessary services such as code updating, topol- ogy discovery and data dissemination are challenging to operate and thus...
doctoral thesis 2013
Van de Bovenkamp, R. (author), Kuipers, F. (author), Van Mieghem, P. (author)
We propose Gossipico, a gossip algorithm to average, sum or find minima and maxima over node values in a large, distributed, and dynamic network. Unlike previous work, Gossipico provides a continuous estimate of, for example, the number of nodes, even when the network becomes disconnected. Gossipico converges quickly due to the introduction of a...
conference paper 2012