Admission control in stochastic event graphs

Citation
E. Altman et al., Admission control in stochastic event graphs, IEEE AUTO C, 45(5), 2000, pp. 854-867
Citations number
15
Categorie Soggetti
AI Robotics and Automatic Control
Journal title
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
ISSN journal
00189286 → ACNP
Volume
45
Issue
5
Year of publication
2000
Pages
854 - 867
Database
ISI
SICI code
0018-9286(200005)45:5<854:ACISEG>2.0.ZU;2-1
Abstract
In this paper, we first show that the expectation of convex increasing func tions of the workload (or waiting time) in (max, +) linear systems, under a single input sequence, is multimodular. This is done using a coupling argu ment and a vectorial version of Lindley's equation. In the second part of t he paper, we use this result and the optimization theory based on multimodu lar costs to construct the optimal open-loop admission control in general ( max, +) linear systems under admission rate constraints. This optimization result only requires stationarity assumptions on the arrival process and on the service times of the servers in the system.