Push-Sum With Transmission Failures

DOI10.1109/TAC.2018.2836861MaRDI QIDQ4629860zbMATH OpenOpenAlexFDO

Authors Balázs Gerencsér, Julien M. Hendrickx

Publication date 28 March 2019

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1504.08193

Mathematics Subject Classification ID

Distributed algorithms (68W15) Fault detection; testing in circuits and networks (94C12)

Abstract: The push-sum algorithm allows distributed computing of the average on a directed graph, and is particularly relevant when one is restricted to one-way and/or asynchronous communications. We investigate its behavior in the presence of unreliable communication channels where messages can be lost. We show that exponential convergence still holds and deduce fundamental properties that implicitly describe the distribution of the final value obtained. We analyze the error of the final common value we get for the essential case of two nodes, both theoretically and numerically. We provide performance comparison with a standard consensus algorithm.

Cited in

(3)

• Direct sum fails for zero error average communication
• Notes on linear gossip algorithms: potentials and challenges
• Brief announcement: Know your audience. Communication model and computability in anonymous networks

This page was built for publication: Push-Sum With Transmission Failures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4629860)