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

Conference paper (2019)

Authors

Franco Blanchini Università degli Studi di Udine
Daniele Casagrande Università degli Studi di Udine
G. Giordano Team Tamas Keviczky - Mechanical, Maritime and Materials Engineering
Raffaele Pesenti Università Ca’ Foscari Venezia
More Info
expand_more

Published Date

2019

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

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.

Files

A_network_decentralised_strate... (pdf)
(pdf | 0.918 Mb)
Unknown license

Download not available