Fully Asynchronous Push-Sum With Growing Intercommunication Intervals

TL;DR

This paper introduces a fully asynchronous algorithm for average consensus in directed graphs that remains robust despite unreliable communications and growing intercommunication intervals.

Contribution

The paper presents a novel asynchronous push-sum algorithm capable of handling unbounded communication failures in directed networks.

Findings

Converges to the average despite unreliable links

Handles growing intercommunication intervals

Robust to unbounded communication failures

Abstract

We propose an algorithm for average consensus over a directed graph which is both fully asynchronous and robust to unreliable communications. We show its convergence to the average, while allowing for slowly growing but potentially unbounded communication failures.