Asynchronous distributed averaging on communication networks

Authors:
Mortada Mehyar;Demetri Spanos;John Pongsajapan;Steven H. Low;Richard M. Murray
Affiliations:
California Institute of Technology, Pasadena, CA;California Institute of Technology, Pasadena, CA;California Institute of Technology, Pasadena, CA;California Institute of Technology, Pasadena, CA;California Institute of Technology, Pasadena, CA
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2007

Citing 7
Cited 12

Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
Distributed Algorithms

Distributed Algorithms
Gossip-Based Computation of Aggregate Information

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
A decentralized algorithm for spectral analysis

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A scheme for robust distributed sensor fusion based on average consensus

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Approximate distributed Kalman filtering in sensor networks with quantifiable performance

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Distributed computation of averages over ad hoc networks

IEEE Journal on Selected Areas in Communications

Distributed classification in peer-to-peer networks

Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Decentralized real-time monitoring of network-wide aggregates

LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
Polynomial filtering for fast convergence in distributed consensus

IEEE Transactions on Signal Processing
Brief paper: Sufficient conditions for connectivity maintenance and rendezvous in leader-follower networks

Automatica (Journal of IFAC)
Gossiping for threshold detection

IM'09 Proceedings of the 11th IFIP/IEEE international conference on Symposium on Integrated Network Management
Optimizing segment caching for peer-to-peer on-demand streaming

ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Controlled hopwise averaging: bandwidth/energy-efficient asynchronous distributed averaging for wireless networks

ACC'09 Proceedings of the 2009 conference on American Control Conference
Brief paper: Discrete-time dynamic average consensus

Automatica (Journal of IFAC)
A vEB-tree-based architecture for interactive video on demand services in peer-to-peer networks

Journal of Network and Computer Applications
Decentralisation of scorefinder: a framework for credibility management on user-generated contents

PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Analysis of accelerated gossip algorithms

Automatica (Journal of IFAC)
ProFID: Practical frequent items discovery in peer-to-peer networks

Future Generation Computer Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.