Non asymptotic bounds in asynchronous sum-weight gossip protocols

11/19/2021
by   David Picard, et al.
8

This paper focuses on non-asymptotic diffusion time in asynchronous gossip protocols. Asynchronous gossip protocols are designed to perform distributed computation in a network of nodes by randomly exchanging messages on the associated graph. To achieve consensus among nodes, a minimal number of messages has to be exchanged. We provides a probabilistic bound to such number for the general case. We provide a explicit formula for fully connected graphs depending only on the number of nodes and an approximation for any graph depending on the spectrum of the graph.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/12/2018

Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model

We provide the first asynchronous distributed algorithms to compute broa...
research
05/23/2022

Distributed Computations in Fully-Defective Networks

We address fully-defective asynchronous networks, in which all links are...
research
07/08/2020

Power-saving Asynchronous Quorum-based Protocols for Maximal Neighbour Discovery

The discovery of neighbouring active nodes is one of the most challengin...
research
05/16/2018

On the Significance of Quiescent Protocols for Asynchronous Perfectly Secure Message Transmission

We consider the problem of perfect (information-theoretically) secure me...
research
07/04/2012

Asynchronous Dynamic Bayesian Networks

Systems such as sensor networks and teams of autonomous robots consist o...
research
12/11/2011

Networks Utilization Improvements for Service Discovery Performance

Service discovery requests' messages have a vital role in sharing and lo...
research
07/28/2023

Swiper and Dora: efficient solutions to weighted distributed problems

The majority of fault-tolerant distributed algorithms are designed assum...

Please sign up or login with your details

Forgot password? Click here to reset