We study two-station closed queueing network models where jobs cyclically visit a non-preemptive last-come first-serve (LCFS-NP) station and a last-come first-serve preemptive-resume (LCFS-PR) station. Jobs belong to multiple classes and receive at both stations exponential service times with arbitrary means. Even though multiclass LCFS-NP stations are not quasi-reversible, we show that the considered models still admit a product-form solution. A feature of the new product-form expression is to include factors that relate the mean service times at the LCFS-NP queue with the positions occupied by the jobs at both stations. To account for job positions, we propose a strategy to compute the normalizing constant of the state probabilities using permanents which, for a fixed number of classes, solves the model exactly in polynomial time as the total number of jobs grows. A mean-value analysis algorithm is also derived, using a recursion on networks where the job holding the last position at the LCFS-PR queue is removed from the model.
Casale, Giuliano. A family of multiclass LCFS networks with a novel product-form solution. // Queueing Systems. – 2026. – DOI: 10.1007/s11134-026-09992-3. – URL: http://link.springer.com/openurl/fulltext?id=doi:10.1007/s11134-026-09992-3
Casale & Giuliano (2026). A family of multiclass LCFS networks with a novel product-form solution. Queueing Systems. https://doi.org/10.1007/s11134-026-09992-3
Casale and Giuliano. “A family of multiclass LCFS networks with a novel product-form solution.” Queueing Systems, 2026. doi:10.1007/s11134-026-09992-3.
@article{Casale2026,
title = {A family of multiclass LCFS networks with a novel product-form solution},
author = {Casale and Giuliano},
journal = {Queueing Systems},
year = {2026},
doi = {10.1007/s11134-026-09992-3},
url = {http://link.springer.com/openurl/fulltext?id=doi:10.1007/s11134-026-09992-3}
}
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...