View source for Distributed Averaging on Asynchronous Communication Networks

{{HTDB paper
| authors = Mortada Mehyar, Demetri Spanos, John Pongsajapan, Steven H. Low, Richard M. Murray
| title = Distributed Averaging on Asynchronous Communication Networks
| source = 2005 Conference on Decision and Control (CDC)
| year = 2005
| type = Conference Paper
| funding = NSF/ITR
| url = http://www.cds.caltech.edu/~murray/preprints/meh+05-cdc.pdf
| abstract = 
Distributed algorithms for averaging have at- 
tracted 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 
do not require global coordination and can be proven to 
converge under very general asynchronous timing assumptions. 
Our results are verified by both simulation and experiments on 
a real-world TCP/IP network.
| flags = 
| tag = meh+05-cdc
| id = 2005m
}}