An Anytime Distributed Load-Balancing Algorithm Satisfying Capacity and Quantization Constraints

Current research in the field of distributed consensus algorithms fails to adequately address physical limitations of real systems. This paper proposes a new algorithm for quantized distributed load balancing over a network of agents subject to upper-limit constraints. More precisely, loads are inte...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on control of network systems Jg. 4; H. 2; S. 279 - 287
Hauptverfasser: Gravelle, Evan, Martinez, Sonia
Format: Journal Article
Sprache:Englisch
Veröffentlicht: IEEE 01.06.2017
Schlagworte:
Algorithm design and analysis
Control systems
Convergence
Cooperative systems
decentralized control
distributed algorithms
Load management
Lyapunov methods
networked control systems
Nickel
Quantization (signal)
ISSN:2325-5870, 2372-2533
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Current research in the field of distributed consensus algorithms fails to adequately address physical limitations of real systems. This paper proposes a new algorithm for quantized distributed load balancing over a network of agents subject to upper-limit constraints. More precisely, loads are integer values, and nodes are constrained to remain under maximum load capacities at all times. Convergence to a set of balanced states is proven for all connected graphs with any feasible initial load distribution, given some conditions on the placement of nodes with finite capacity. We present simulations that verify our results and discuss possible extensions of the algorithm.
ISSN:2325-5870
2372-2533
DOI:10.1109/TCNS.2015.2498459