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 L 1 -norm. This approach has the advantage of providing a solution that is generically 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
A network-decentralised strategy for shortest-path-flow routing
Raffaele Pesenti
2019-01-01
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 L 1 -norm. This approach has the advantage of providing a solution that is generically 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 pathFile | Dimensione | Formato | |
---|---|---|---|
minpa_18.pdf
non disponibili
Descrizione: Articolo principale pre-print
Tipologia:
Documento in Pre-print
Licenza:
Accesso chiuso-personale
Dimensione
493.03 kB
Formato
Adobe PDF
|
493.03 kB | Adobe PDF | Visualizza/Apri |
I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.