Distributed balancing in digraphs under interval constraints

Christoforos N. Hadjicostis, Alejandro D. Domínguez-García

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.

Original languageEnglish (US)
Title of host publication2016 IEEE 55th Conference on Decision and Control, CDC 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages6
ISBN (Electronic)9781509018376
StatePublished - Dec 27 2016
Event55th IEEE Conference on Decision and Control, CDC 2016 - Las Vegas, United States
Duration: Dec 12 2016Dec 14 2016

Publication series

Name2016 IEEE 55th Conference on Decision and Control, CDC 2016


Other55th IEEE Conference on Decision and Control, CDC 2016
Country/TerritoryUnited States
CityLas Vegas

ASJC Scopus subject areas

  • Artificial Intelligence
  • Decision Sciences (miscellaneous)
  • Control and Optimization


Dive into the research topics of 'Distributed balancing in digraphs under interval constraints'. Together they form a unique fingerprint.

Cite this