A resistance-based approach to performance analysis of the consensus algorithm

Enrico Lovisari 1, * Federica Garin 2 Sandro Zampieri 1
* Auteur correspondant
2 NECS - Networked Controlled Systems
Inria Grenoble - Rhône-Alpes, GIPSA-DA - Département Automatique
Abstract : We study the well-known linear consensus algorithm by means of a LQ-type performance cost. We want to understand how the communication topology influences this algorithm. In order to do this, we recall the analogy between Markov Chains and electrical resistive networks. By exploiting this analogy, we are able to rewrite the performance cost as the average effective resistance on a suitable network. We use this result to show that if the communication graph fulfills some local properties, then its behavior can be approximated with that of a suitable grid, over which the behavior of the cost is known.
Type de document :
Communication dans un congrès
19th International Symposium on Mathematical Theory of Networks and Systems (MTNS 2010), Jul 2010, Budapest, Hungary. 2010
Liste complète des métadonnées

https://hal.inria.fr/inria-00534491
Contributeur : Federica Garin <>
Soumis le : mardi 9 novembre 2010 - 18:22:47
Dernière modification le : mardi 10 juillet 2018 - 01:18:01

Identifiants

  • HAL Id : inria-00534491, version 1

Collections

Citation

Enrico Lovisari, Federica Garin, Sandro Zampieri. A resistance-based approach to performance analysis of the consensus algorithm. 19th International Symposium on Mathematical Theory of Networks and Systems (MTNS 2010), Jul 2010, Budapest, Hungary. 2010. 〈inria-00534491〉

Partager

Métriques

Consultations de la notice

307