A linear programming approach to Markov reward error bounds for queueing networks

DOI10.1007/978-3-030-27181-7_13zbMath1437.90044arXiv1811.08667OpenAlexW2970785232MaRDI QIDQ2177556

Xinwei Bai, Jasper Goseling

Publication date: 6 May 2020

Full work available at URL: https://arxiv.org/abs/1811.08667

zbMATH Keywords

linear programmingerror boundmulti-dimensional random walkstationary performance measuresMarkov reward approach

Mathematics Subject Classification ID

Linear programming (90C05) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)

This page was built for publication: A linear programming approach to Markov reward error bounds for queueing networks