Related papers: On Mixed Time-Changed Erlang Queue
In this paper, we introduce and study a time-changed variant of the Erlang queue with multiple arrivals where the time-changing component used is the first hitting time of a tempered stable subordinator. The system of fractional…
We introduce and study a queue with the Erlang service system and whose arrivals are governed by a counting process in which there is a possibility of finitely many arrivals in an infinitesimal time interval. We call it the Erlang queue…
We introduce a fractional generalization of the Erlang Queues $M/E_k/1$. Such process is obtained through a time-change via inverse stable subordinator of the classical queue process. We first exploit the (fractional) Kolmogorov forward…
We study a queueing system with Erlang arrivals with $k$ phases and Erlang service with $m$ phases. Transition rates among phases vary periodically with time. For these systems, we derive the asymptotic periodic distribution of the level…
We study two time-changed variants of the birth-death process with catastrophe where the time-changing components are the first hitting times of the stable subordinator and the tempered stable subordinator. For both the processes, we derive…
The non-stationary Erlang-A queue is a fundamental queueing model that is used to describe the dynamic behavior of large scale multi-server service systems that may experience customer abandonments, such as call centers, hospitals, and…
Service systems like data centers and ride-hailing are popularly modeled as queueing systems in the literature. Such systems are primarily studied in the steady state due to their analytical tractability. However, almost all applications in…
We consider a model describing the waiting time of a server alternating between two service points. This model is described by a Lindley-type equation. We are interested in the time-dependent behaviour of this system and derive explicit…
We consider the Erlang A model, or $M/M/m+M$ queue, with Poisson arrivals, exponential service times, and $m$ parallel servers, and the property that waiting customers abandon the queue after an exponential time. The queue length process is…
We consider a hybrid diffusion process that is a combination of two Ornstein-Uhlenbeck processes with different restraining forces. This process serves as the heavy-traffic approximation to the Markovian many-server queue with abandonments…
We discuss a single-server multi-station alternating queue where the preparation times and the service times are auto- and cross-correlated. We examine two cases. In the first case, preparation and service times depend on a common discrete…
Systems of differential equations with state-dependent delay are considered. The delay dynamically depends on the state i.e. is governed by an additional differential equation. By applying the time transformations we arrive to constant…
This exposition presents a novel approach to solving an M/M/m queue for the waiting time and the residence time. The motivation comes from an algebraic solution for the residence time of the M/M/1 queue. The key idea is the introduction of…
With the development of information technology, requirements for data flow have become diverse. When multi-type data flow (MDF) is used, games, videos, calls, etc. are all requirements. There may be a constant switch between these…
Let $X$ be the constrained random walk on ${\mathbb Z}_+^2$ with increments $(1,0)$, $(-1,0)$, $(0,1)$ and $(0,-1)$; $X$ represents, at arrivals and service completions, the lengths of two queues working in parallel whose service and…
In this paper, we study queueing systems with delayed information that use a generalization of the multinomial logit choice model as its arrival process. Previous literature assumes that the functional form of the multinomial logit model is…
In this paper, we investigate the number of customers that overlap or coincide with a virtual customer in an Erlang-A queue. Our study provides a novel approach that exploits fluid and diffusion limits for the queue to approximate the mean…
We present a method for computing the likelihood of a mixed hitting-time model that specifies durations as the first time a latent L\'evy process crosses a heterogeneous threshold. This likelihood is not generally known in closed form, but…
The distribution of the "mixing time" or the "time to stationarity" in a discrete time irreducible Markov chain, starting in state i, can be defined as the number of trials to reach a state sampled from the stationary distribution of the…
We study the rare event behavior of the workload process in a transitory queue, where the arrival epochs (or points) of a finite number of jobs are assumed to be the ordered statistics of independent and identically distributed (i.i.d.)…