A linear programming approach to routing control in networks of constrained linear positive systems

We study routing control in dynamic continuous-time networks in which each node is described by a linear internally positive system. We derive a linear programming (LP) characterization of optimal constant routing policies for the infinite-horizon routing problem under weighted l1 constraints and ob...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Automatica (Oxford) 2012-05, Vol.48 (5), p.800-807
Hauptverfasser:	Arneson, Heather, Langbort, Cédric
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Computer networks Computer science control theory systems Computer systems and distributed systems. User interface Control of networks Control systems Control theory. Systems Controller constraints and structure Dynamical systems Dynamics Exact sciences and technology Linear programming Mathematical analysis Mathematical programming Networks Operational research and scientific management Operational research. Management science Positive systems Routing (telecommunications) Software System theory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We study routing control in dynamic continuous-time networks in which each node is described by a linear internally positive system. We derive a linear programming (LP) characterization of optimal constant routing policies for the infinite-horizon routing problem under weighted l1 constraints and objective. For finite horizon problems with piecewise constant state constraints, we provide sufficient feasibility conditions, which also take the form of an LP problem. We illustrate the solution for the finite horizon problem in an application example.
ISSN:	0005-1098 1873-2836
DOI:	10.1016/j.automatica.2012.02.001