Coupling in the queue with impatience: case of several servers
Probability
2017-11-20 v2
Abstract
We present the explicit construction of a stable queue with several servers and impatient customers, under stationary ergodic assumptions. Using a stochastic comparison of the (multivariate) workload sequence with two monotonic stochastic recursions, we propose a sufficient condition of existence of a unique stationary state of the system using Renovation theory. Whenever this condition is relaxed we use extension techniques to prove the existence of a stationary state in some cases.
Cite
@article{arxiv.1711.02931,
title = {Coupling in the queue with impatience: case of several servers},
author = {Pascal Moyal},
journal= {arXiv preprint arXiv:1711.02931},
year = {2017}
}