Distributed averaging in dynamic networks

Authors:
Shreevatsa Rajagopalan;Devavrat Shah
Affiliations:
Massachusetts Institute of Technology, Cambridge, MA, USA;Massachusetts Institute of Technology, Cambridge, MA, USA
Venue:
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Year:
2010

Citing 1
Cited 0

Computing separable functions via gossip

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Distributed averaging is a well-studied problem, and often a "prototype" for a class of fundamental questions arising in various disciplines. Previous work has considered the effect of dynamics in the network topology, in terms of changes in which communication links are present. Here, we analyze the other forms of dynamics, namely: changes in the values at the nodes, and nodes joining or leaving the network.