TY - GEN

T1 - Distributed balancing in digraphs under interval constraints

AU - Hadjicostis, Christoforos N.

AU - Dominguez-Garcia, Alejandro

PY - 2016/12/27

Y1 - 2016/12/27

N2 - We consider networks the nodes of which are interconnected via directed edges, each able to admit a flow within a certain interval, with nonnegative end points that correspond to lower and upper flow limits. The paper proposes and analyzes a distributed algorithm for obtaining admissable and balanced flows, i.e., flows that are within the given intervals at each edge and are balanced (the total in-flow equals the total out-flow) at each node. The algorithm can also be viewed as a distributed method for obtaining a set of weights that balance a digraph for the case when there are upper and lower limit constraints on the edge weights. The proposed iterative algorithm assumes that communication among pairs of nodes that are interconnected is bidirectional (i.e., the communication topology is captured by the undirected graph that corresponds to the network digraph), and allows the nodes to asymptotically (with geometric rate) reach a set of balanced feasible flows, as long as the circulation conditions on the given digraph, with the given flow/weight interval constraints on each edge, are satisfied.

AB - We consider networks the nodes of which are interconnected via directed edges, each able to admit a flow within a certain interval, with nonnegative end points that correspond to lower and upper flow limits. The paper proposes and analyzes a distributed algorithm for obtaining admissable and balanced flows, i.e., flows that are within the given intervals at each edge and are balanced (the total in-flow equals the total out-flow) at each node. The algorithm can also be viewed as a distributed method for obtaining a set of weights that balance a digraph for the case when there are upper and lower limit constraints on the edge weights. The proposed iterative algorithm assumes that communication among pairs of nodes that are interconnected is bidirectional (i.e., the communication topology is captured by the undirected graph that corresponds to the network digraph), and allows the nodes to asymptotically (with geometric rate) reach a set of balanced feasible flows, as long as the circulation conditions on the given digraph, with the given flow/weight interval constraints on each edge, are satisfied.

UR - http://www.scopus.com/inward/record.url?scp=85010821996&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85010821996&partnerID=8YFLogxK

U2 - 10.1109/CDC.2016.7798521

DO - 10.1109/CDC.2016.7798521

M3 - Conference contribution

AN - SCOPUS:85010821996

T3 - 2016 IEEE 55th Conference on Decision and Control, CDC 2016

SP - 1769

EP - 1774

BT - 2016 IEEE 55th Conference on Decision and Control, CDC 2016

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 55th IEEE Conference on Decision and Control, CDC 2016

Y2 - 12 December 2016 through 14 December 2016

ER -