Asynchronous Distributed Averaging on Communication Networks
Mehyar, M.
Spanos, D.
Pongsajapan, J.
Low, S.H.
Murray, R.M.
California Inst. of Technol., Pasadena;
This paper appears in: Networking, IEEE/ACM Transactions on
Publication Date: June 2007
Volume: 15,
Issue: 3
On page(s): 512-520
Location: San Francisco, CA, USA,
ISSN: 1063-6692
INSPEC Accession Number: 9591447
Digital Object Identifier: 10.1109/TNET.2007.893226
Current Version Published: 2007-06-18
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
