Deciding and verifying network properties locally with few output bits

Heger Arfaoui (1) , Pierre Fraigniaud (2) , David Ilcinkas (3) , Fabien Mathieu (4) , Andrzej Pelc (5)

1 SMU - South Mediterranean University Group
2 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
3 LaBRI - Laboratoire Bordelais de Recherche en Informatique
4 Nokia Bell Labs
5 DII - Département d'Informatique et d'Ingénierie

Given a boolean predicate on labeled networks (e.g., the network is acyclic, or the network is properly colored, etc.), deciding in a distributed manner whether a given labeled network satisfies that predicate typically consists, in the standard setting, of every node inspecting its close neighborhood, and outputting a boolean verdict, such that the network satisfies the predicate if and only if all nodes output true. In this paper, we investigate a more general notion of distributed decision in which every node is allowed to output a constant number $b\geq 1$ of bits, which are gathered by a central authority emitting a global boolean verdict based on these outputs, such that the network satisfies the predicate if and only if this global verdict equals true. We analyze the power and limitations of this extended notion of distributed decision.

Keywords: Distributed decision; Distributed verification; Locality; Network

Domains: Distributed, Parallel, and Cluster Computing [cs.DC]

Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu, Andrzej Pelc. Deciding and verifying network properties locally with few output bits. Distributed Computing, 2020, 33, pp.169-187. ⟨10.1007/s00446-019-00355-1⟩. ⟨hal-02285014⟩