Asynchronous Distributed Averaging on Communication Networks
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.
Additional Information
© Copyright 2007 IEEE. Reprinted with permission. Manuscript received August 5, 2005; revised January 19, 2006, and March 1, 2006; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor A. Orda. [Posted online: 2007-06-18] The first author would like to thank Prof. J. Tsitsiklis and his student A. Olshevsky for pointing out mistakes and offering useful suggestions.Files
| Name | Size | Download all |
|---|---|---|
|
md5:a0424a70b9633a19ad7d0bf6508f19f2
|
580.5 kB | Preview Download |
Additional details
- Eprint ID
- 8522
- Resolver ID
- CaltechAUTHORS:MEHieeeacmtn07
- Created
-
2007-08-17Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field