Author:
Sirocchi Christel,Bogliolo Alessandro
Abstract
AbstractGossip algorithms are message-passing schemes designed to compute averages and other global functions over networks through asynchronous and randomised pairwise interactions. Gossip-based protocols have drawn much attention for achieving robust and fault-tolerant communication while maintaining simplicity and scalability. However, the frequent propagation of redundant information makes them inefficient and resource-intensive. Most previous works have been devoted to deriving performance bounds and developing faster algorithms tailored to specific structures. In contrast, this study focuses on characterising the effect of topological network features on performance so that faster convergence can be engineered by acting on the underlying network rather than the gossip algorithm. The numerical experiments identify the topological limiting factors, the most predictive graph metrics, and the most efficient algorithms for each graph family and for all graphs, providing guidelines for designing and maintaining resource-efficient networks. Regression analyses confirm the explanatory power of structural features and demonstrate the validity of the topological approach in performance estimation. Finally, the high predictive capabilities of local metrics and the possibility of computing them in a distributed manner and at a low computational cost inform the design and implementation of a novel distributed approach for predicting performance from the network topology.
Publisher
Springer Science and Business Media LLC
Reference60 articles.
1. Boyd, S., Ghosh, A., Prabhakar, B. & Shah, D. Randomized gossip algorithms. IEEE Trans. Inf. Theory 52, 2508–2530 (2006).
2. Boyd, S., Ghosh, A., Prabhakar, B. & Shah, D. Gossip algorithms: Design, analysis and applications. In Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies., vol. 3, 1653–1664 (IEEE, 2005).
3. Garone, E., Gasparri, A. & Lamonaca, F. Clock synchronization protocol for wireless sensor networks with bounded communication delays. Automatica 59, 60–72 (2015).
4. Olfati-Saber, R., Fax, J. A. & Murray, R. M. Consensus and cooperation in networked multi-agent systems. Proc. IEEE 95, 215–233 (2007).
5. Franceschelli, M. & Gasparri, A. Gossip-based centroid and common reference frame estimation in multiagent systems. IEEE Trans. Robot. 30, 524–531 (2013).
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Node Embedding Accelerates Randoms Walk on a Graph;2024 IEEE 48th Annual Computers, Software, and Applications Conference (COMPSAC);2024-07-02
2. On the Impact of Network Topology on Distributed Online Kernel Learning;2024 IEEE 48th Annual Computers, Software, and Applications Conference (COMPSAC);2024-07-02
3. Performance Analysis of Gossip Algorithms for Large Scale Wireless Sensor Networks;IEEE Open Journal of the Computer Society;2024
4. Distributed Averaging for Accuracy Prediction in Networked Systems;Lecture Notes in Computer Science;2024
5. Community-Based Gossip Algorithm for Distributed Averaging;Distributed Applications and Interoperable Systems;2023