—We consider distributed iterative algorithms for the averaging problem over time-varying topologies. Our focus is on the convergence time of such algorithms when complete (unqua...
Angelia Nedic, Alexander Olshevsky, Asuman E. Ozda...
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do...
Ruggero Carli, Giacomo Como, Paolo Frasca, Federic...
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
—We analyze how node mobility can influence the convergence time of averaging gossip algorithms on networks. Our main result is that even a small number of fully mobile nodes ca...
Abstract-- We study the convergence rate of average consensus algorithms in networks with stochastic communication failures. We show how the system dynamics can be modeled by a dis...