https://murray.cds.caltech.edu/index.php?action=history&feed=atom&title=Distributed_Averaging_on_Asynchronous_Communication_Networks 2026-06-26T10:43:32Z Revision history for this page on the wiki MediaWiki 1.44.2 https://murray.cds.caltech.edu/index.php?title=Distributed_Averaging_on_Asynchronous_Communication_Networks&diff=19868&oldid=prev 2016-05-15T06:17:52Z

<p>htdb2wiki: creating page for 2005m_meh+05-cdc.html</p> <p><b>New page</b></p><div>{{HTDB paper<br /> | authors = Mortada Mehyar, Demetri Spanos, John Pongsajapan, Steven H. Low, Richard M. Murray<br /> | title = Distributed Averaging on Asynchronous Communication Networks<br /> | source = 2005 Conference on Decision and Control (CDC)<br /> | year = 2005<br /> | type = Conference Paper<br /> | funding = NSF/ITR<br /> | url = http://www.cds.caltech.edu/~murray/preprints/meh+05-cdc.pdf<br /> | abstract = <br /> Distributed algorithms for averaging have at- <br /> tracted interest in the control and sensing literature. However, <br /> previous works have not addressed some practical concerns <br /> that will arise in actual implementations on packet-switched <br /> communication networks such as the Internet. In this paper, <br /> we present several implementable algorithms that are robust to <br /> asynchronism and dynamic topology changes. The algorithms <br /> do not require global coordination and can be proven to <br /> converge under very general asynchronous timing assumptions. <br /> Our results are verified by both simulation and experiments on <br /> a real-world TCP/IP network.<br /> | flags = <br /> | tag = meh+05-cdc<br /> | id = 2005m<br /> }}</div>

Murray