Admission control in stochastic event graphs
Lists
Only you see this
Abstract
We first show that the expectation of convex increasing functions of the workload (or waiting time) in (max, +) linear systems, under a single input sequence, is multi-modular. This is done using a coupling argument and a vectorial version of Lindley's equation. Next, we use this result and the optimization theory based on multi-modular 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.
BibTeX
@article{altman2000admission,
author = {Eitan Altman and Bruno Gaujal and Arie Hordijk},
title = {{Admission control in stochastic event graphs}},
journal = {IEEE Trans. Automatic Control},
year = {2000},
url = {https://openreview.net/forum?id=PNEpArEVrx},
}Loading related content...