Asynchronous Distributed Averaging on Communication Networks

Distributed algorithms for averaging have attracted interest in the control and sensing literature. However, previous works have not addressed some practical concerns that will arise in actual implementations on packet-switched communication networks such as the Internet. In this paper, we present several implementable algorithms that are robust to asynchronism and dynamic topology changes. The algorithms are completely distributed and do not require any global coordination. In addition, they can be proven to converge under very general asynchronous timing assumptions. Our results are verified by both simulation and experiments on Planetlab, a real-world TCP/IP network. We also present some extensions that are likely to be useful in applications.

[1]  Johannes Gehrke,et al.  Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[2]  John N. Tsitsiklis,et al.  Problems in decentralized decision making and computation , 1984 .

[3]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[4]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[5]  Stephen P. Boyd,et al.  Fast linear iterations for distributed averaging , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[6]  Stephen P. Boyd,et al.  Gossip algorithms: design, analysis and applications , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[7]  R.M. Murray,et al.  Distributed Averaging on Asynchronous Communication Networks , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[8]  Haralabos C. Papadopoulos,et al.  Distributed computation of averages over ad hoc networks , 2005, IEEE Journal on Selected Areas in Communications.

[9]  R. Merris.  Laplacian matrices of graphs: a survey , 1994 .

[10]  Richard M. Murray,et al.  DYNAMIC CONSENSUS FOR MOBILE NETWORKS , 2005 .

[11]  Stephen P. Boyd,et al.  A scheme for robust distributed sensor fusion based on average consensus , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[12]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[13]  Richard M. Murray,et al.  DISTRIBUTED SENSOR FUSION USING DYNAMIC CONSENSUS , 2005 .

[14]  David Kempe,et al.  A decentralized algorithm for spectral analysis , 2004, STOC '04.

[15]  John N. Tsitsiklis,et al.  Distributed Asynchronous Deterministic and Stochastic Gradient Optimization Algorithms , 1984, 1984 American Control Conference.

[16]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[17]  Richard M. Murray,et al.  Information flow and cooperative control of vehicle formations , 2004, IEEE Transactions on Automatic Control.

[18]  Richard M. Murray,et al.  Approximate distributed Kalman filtering in sensor networks with quantifiable performance , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..