TY - GEN
T1 - Distributed balancing under interval flow constraints in directed communication topologies
AU - Hadjicostis, Christoforos N.
AU - Dominguez-Garcia, Alejandro D.
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/6/28
Y1 - 2017/6/28
N2 - In this paper, we propose a distributed algorithm that relies on a strongly connected (but possibly directed) communication topology to achieve admissible and balanced flows in a given network. More specifically, we consider a flow network that is described by a digraph (physical topology), each edge of which can admit a flow within a certain interval. The paper proposes and analyzes a distributed iterative algorithm for computing admissible and balanced flows, i.e., flows that are within the given interval at each edge and balance the total inflow and the total out-flow at each node. Unlike previous work that required a communication topology with bidirectional exchanges between pairs of nodes that are physically connected (i.e., nodes that share an edge in the physical topology), the distributed algorithm we propose only requires a communication topology that matches the physical topology (which is, in general, directed). The proposed algorithm allows the nodes to asymptotically (with geometric rate) compute a set of admissible and balanced flows, as long as such solution exists.
AB - In this paper, we propose a distributed algorithm that relies on a strongly connected (but possibly directed) communication topology to achieve admissible and balanced flows in a given network. More specifically, we consider a flow network that is described by a digraph (physical topology), each edge of which can admit a flow within a certain interval. The paper proposes and analyzes a distributed iterative algorithm for computing admissible and balanced flows, i.e., flows that are within the given interval at each edge and balance the total inflow and the total out-flow at each node. Unlike previous work that required a communication topology with bidirectional exchanges between pairs of nodes that are physically connected (i.e., nodes that share an edge in the physical topology), the distributed algorithm we propose only requires a communication topology that matches the physical topology (which is, in general, directed). The proposed algorithm allows the nodes to asymptotically (with geometric rate) compute a set of admissible and balanced flows, as long as such solution exists.
UR - http://www.scopus.com/inward/record.url?scp=85046118955&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85046118955&partnerID=8YFLogxK
U2 - 10.1109/CDC.2017.8263799
DO - 10.1109/CDC.2017.8263799
M3 - Conference contribution
AN - SCOPUS:85046118955
T3 - 2017 IEEE 56th Annual Conference on Decision and Control, CDC 2017
SP - 1070
EP - 1075
BT - 2017 IEEE 56th Annual Conference on Decision and Control, CDC 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 56th IEEE Annual Conference on Decision and Control, CDC 2017
Y2 - 12 December 2017 through 15 December 2017
ER -