We consider queueing models, where customers arrive according to a continuous-time binomial process on a finite interval. In this arrival process, a total of K customers arrive in the finite time interval [0, T ], where arrival times of those K customers are independent and identically distributed according to an absolutely continuous distribution defined by its probability density function f ( t ) on (0, T ]. To analyze the time-dependent queue length distribution of this model, we introduce an auxiliary model with non-homogeneous Poisson arrivals and show that the time-dependent queue length distribution in the original model is given in terms of the time-dependent joint distribution of the numbers of arrivals and departures in the auxiliary model. Next, we consider a numerical procedure for computing the time-dependent queue length distribution in Markovian models with piecewise constant f ( t ). A particular feature of our computational procedure is that the truncation error bound can be specified as an input parameter. Some numerical examples are also provided.
Hayashi, Kaito, Inoue, Yoshiaki, Takine, Tetsuya. Time-dependent queue length distribution in queues fed by K customers in a finite interval. // Queueing Systems. – 2026. – DOI: 10.1007/s11134-026-09987-0. – URL: http://link.springer.com/openurl/fulltext?id=doi:10.1007/s11134-026-09987-0
Hayashi, Kaito, Inoue, Yoshiaki, Takine, & Tetsuya (2026). Time-dependent queue length distribution in queues fed by K customers in a finite interval. Queueing Systems. https://doi.org/10.1007/s11134-026-09987-0
Hayashi, et al. “Time-dependent queue length distribution in queues fed by K customers in a finite interval.” Queueing Systems, 2026. doi:10.1007/s11134-026-09987-0.
@article{Hayashi2026,
title = {Time-dependent queue length distribution in queues fed by K customers in a finite interval},
author = {Hayashi and Kaito and Inoue and Yoshiaki and Takine and Tetsuya},
journal = {Queueing Systems},
year = {2026},
doi = {10.1007/s11134-026-09987-0},
url = {http://link.springer.com/openurl/fulltext?id=doi:10.1007/s11134-026-09987-0}
}
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...