How to communicate efficiently (Q750126)

The paper proposes an algorithm for the so-called decentralized consensus problem. In a network with n knots, information is to be gathered from all knots, synthesized, and the outcome must be made known to all knots. The goal is to minimize the global amount of communication. The presented strategy is based on finite geometries and achieves an amount of O(n log n).