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

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on control of network systems Vol. 4; no. 2; pp. 279 - 287
Main Authors: Gravelle, Evan, Martinez, Sonia
Format: Journal Article
Language:English
Published: IEEE 01.06.2017
Subjects:
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 Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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