A network-decentralised strategy for shortest-path-flow routing

Franco Blanchini, Daniele Casagrande, Filippo Fabiani, Giulia Giordano, Raffaele Pesenti

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

3 Citations (Scopus)


To control the flow in a dynamical network where the nodes are associated with buffer variables and the arcs with controlled flows, we consider a network-decentralised strategy such that each arc controller makes its decision exclusively based on local information about the levels of the buffers that it connects. We seek a flow control law that asymptotically minimises a cost specified in terms of a weighted L1-norm. This approach has the advantage of providing a solution that is generally sparse, because it uses a limited number of controlled flows. In particular, in the presence of a resource demand applied on a single node, the asymptotic flow is concentrated along the shortest path.

Original languageEnglish
Title of host publicationProceedings of the IEEE 58th Conference on Decision and Control, CDC 2019
ISBN (Electronic)978-1-7281-1398-2
Publication statusPublished - 2019
Event58th IEEE Conference on Decision and Control, CDC 2019 - Nice, France
Duration: 11 Dec 201913 Dec 2019


Conference58th IEEE Conference on Decision and Control, CDC 2019


Dive into the research topics of 'A network-decentralised strategy for shortest-path-flow routing'. Together they form a unique fingerprint.

Cite this