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 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.

Keywords

Asynchronous communicationComputer scienceDistributed computingImplementationNetwork topologyThe InternetNetwork packetPacket switchingTelecommunications networkDistributed algorithmComputer networkTheoretical computer science

Affiliated Institutions

Related Publications

Publication Info

Year
2006
Type
article
Pages
7446-7451
Citations
46
Access
Closed

External Links

View on DOI.org

Social Impact

Altmetric
PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

46
OpenAlex

Cite This

Mortada Mehyar, D.P. Spanos, John Pongsajapan et al. (2006). Distributed Averaging on Asynchronous Communication Networks. , 7446-7451. https://doi.org/10.1109/cdc.2005.1583363

Identifiers

DOI
10.1109/cdc.2005.1583363