On the convergence time of distributed quantized averaging algorithms

We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of these algorithms is subject to the realistic constraint that the communication rate, the memory capacities of agents and the...

Full description

Saved in:
Bibliographic Details
Published in2008 47th IEEE Conference on Decision and Control pp. 3971 - 3976
Main Authors Minghui Zhu, Martinez, S.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2008
Subjects
Asynchronous communication
Channel capacity
Communication channels
Communication networks
Communication switching
Convergence
Load management
Network topology
Polynomials
Quantization
Online AccessGet full text
ISBN9781424431236
1424431239
ISSN0191-2216
DOI10.1109/CDC.2008.4738749

Cover

More Information
Summary:We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of these algorithms is subject to the realistic constraint that the communication rate, the memory capacities of agents and the computation precision are finite. The focus of this paper is on the study of the convergence time of the proposed quantized averaging algorithms. By appealing to random walks on graphs, we derive polynomial bounds on the expected convergence time of all the algorithms presented.
ISBN:9781424431236
1424431239
ISSN:0191-2216
DOI:10.1109/CDC.2008.4738749