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.

中文翻译：

---

排队不耐烦耦合：多台服务器的情况

在平稳遍历假设下，我们展示了具有多个服务器和不耐烦的客户的稳定队列的显式构造。使用（多变量）工作负载序列与两个单调随机递归的随机比较，我们提出了使用革新理论的系统唯一静止状态存在的充分条件。每当这个条件放松时，我们就使用扩展技术来证明在某些情况下静止状态的存在。