In this paper, we introduce a versatile scheme for optimizing the arrival rates of quasi-reversible queueing systems. We first propose an alternative definition of quasi-reversibility that encompasses reversibility and highlights the importance of the definition of customer classes. Then we introduce balanced arrival control policies, which generalize the notion of balanced arrival rates introduced in the context of Whittle networks, to the much broader class of quasi-reversible queueing systems. We prove that supplementing a quasi-reversible queueing system with a balanced arrival control policy preserves the quasi-reversibility, and we specify the form of the stationary measures. We revisit two canonical examples of quasi-reversible queueing systems, Whittle networks and order-independent queues. Lastly, we focus on the problem of admission control and leverage our results in the frameworks of optimization and reinforcement learning.
Admission control of quasi-reversible queueing systems: optimization and reinforcement learning. // Biological Research. – 2026. – DOI: 10.1007/s11134-026-09999-w. – URL: https://link.springer.com/article/10.1007/s11134-026-09999-w
(2026). Admission control of quasi-reversible queueing systems: optimization and reinforcement learning. Biological Research. https://doi.org/10.1007/s11134-026-09999-w
“Admission control of quasi-reversible queueing systems: optimization and reinforcement learning.” Biological Research, 2026. doi:10.1007/s11134-026-09999-w.
@article{article32567,
title = {Admission control of quasi-reversible queueing systems: optimization and reinforcement learning},
journal = {Biological Research},
year = {2026},
doi = {10.1007/s11134-026-09999-w},
url = {https://link.springer.com/article/10.1007/s11134-026-09999-w}
}
We introduce several dynamic models of sources of “posts” publishing them on a “newsfeed” in e.g. some social media. All of them have a product-form stationary distribution. We define four metrics relevant to these newsfeeds and compute...
We study a restricted version of the Erlang-R queueing model that has both server and space constraints, in which the space restriction is administered by two types of admission policies: blocking or holding in a pre-entrant queue. This...
Single-server queues with customer abandonment arise in call centers and other service systems, yet their steady-state performance is analytically tractable only in special cases. We develop Robust Queueing approximations for the mean...
Semimartingale reflecting Brownian motions (SRBMs) are an integral part of queueing theory. Fluid paths are a standard tool for demonstrating positive recurrence of SRBMs, and their convergence provides both necessary and sufficient...
We study a non-stationary state-dependent Hawkes single-server queueing model with both time-varying arrival and service rates, under the first-come first-served discipline. The arrival process is a Hawkes process with a time-varying...