Tight Bounds for Asymptotic and Approximate Consensus

Matthias Függer 1, 2, 3, 4 Thomas Nowak 5 Manfred Schwarz 6
4 MEXICO - Modeling and Exploitation of Interaction and Concurrency
LSV - Laboratoire Spécification et Vérification [Cachan], ENS Cachan - École normale supérieure - Cachan, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8643
5 ParSys - LRI - Systèmes parallèles (LRI)
LRI - Laboratoire de Recherche en Informatique
Abstract : We study the performance of asymptotic and approximate consensus algorithms under harsh environmental conditions. The asymptotic consensus problem requires a set of agents to repeatedly set their outputs such that the outputs converge to a common value within the convex hull of initial values. This problem, and the related approximate consensus problem, are fundamental building blocks in distributed systems where exact consensus among agents is not required or possible, e.g., man-made distributed control systems , and have applications in the analysis of natural distributed systems, such as flocking and opinion dynamics. We prove tight lower bounds on the contraction rates of asymptotic consensus algorithms in dynamic networks, from which we deduce bounds on the time complexity of approximate consensus algorithms. In particular, the obtained bounds show optimality of asymptotic and approximate consensus algorithms presented in [Charron-Bost et al., ICALP'16] for certain dynamic networks, including the weakest dynamic network model in which asymptotic and approximate consensus are solvable. As a corollary we also obtain asymptotically tight bounds for asymptotic consensus in the classical asynchronous model with crashes. Central to our lower bound proofs is an extended notion of valency, the set of reachable limits of an asymptotic consensus algorithm starting from a given configuration. We further relate topological properties of valencies to the solvability of exact consensus , shedding some light on the relation of these three fundamental problems in dynamic networks.
Type de document :
Communication dans un congrès
ACM Symposium on Principles of Distributed Computing (PODC'18), Jul 2018, Egham, United Kingdom. 2018, 〈10.1145/3212734.3212762〉
Liste complète des métadonnées

Littérature citée [32 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01799039
Contributeur : Thomas Nowak <>
Soumis le : jeudi 24 mai 2018 - 11:38:21
Dernière modification le : mercredi 28 novembre 2018 - 01:21:37
Document(s) archivé(s) le : samedi 25 août 2018 - 13:54:36

Fichier

paper.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Matthias Függer, Thomas Nowak, Manfred Schwarz. Tight Bounds for Asymptotic and Approximate Consensus. ACM Symposium on Principles of Distributed Computing (PODC'18), Jul 2018, Egham, United Kingdom. 2018, 〈10.1145/3212734.3212762〉. 〈hal-01799039〉

Partager

Métriques

Consultations de la notice

212

Téléchargements de fichiers

119