English
Related papers

Related papers: Fractional Erlang Queues

200 papers

We propose a generalization of the classical M/M/1 queue process. The resulting model is derived by applying fractional derivative operators to a system of difference-differential equations. This generalization includes both non-Markovian…

Probability · Mathematics 2015-09-21 Dexter O. Cahoy , Federico Polito , Vir V. Phoha

We study a time-changed variant of the Erlang queue by taking the first hitting time of a mixed stable subordinator as the time-changing component. We call it the mixed time-changed Erlang queue. We derive the system of fractional…

Probability · Mathematics 2025-05-13 Rohini Bhagwanrao Pote , Kuldeep Kumar Kataria

We introduce a non-Markovian generalization of the classical M/M/1 queue by incorporating extended nonlocal time dynamics into Kolmogorov forward equations. We obtain the model by replacing the standard time derivative with an extended…

Methodology · Statistics 2026-02-03 Mehmet Sıddık Çadırcı

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…

Probability · Mathematics 2025-09-30 Manisha Dhillon , Kuldeep Kumar Kataria

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…

Probability · Mathematics 2025-01-16 R. B. Pote , K. K. Kataria

A single queueing system with time-dependent exponentially distributed arrival processes and exponential machine processes (Kendall notation $M_t/M_t/1$) is analyzed. Modeling the time evolution for the discrete queue-length distribution by…

Probability · Mathematics 2018-12-21 Dieter Armbruster , Simone Göttlich , Stephan Knapp

A $M/M/1$ queue with catastrophes is a modified $M/M/1$ queue model for which, according to the times of a Poisson process, catastrophes occur leaving the system empty. In this work, we study a fractional $M/M/1$ queue with catastrophes,…

Probability · Mathematics 2021-07-13 Matheus de Oliveira Souza , Pablo Martin Rodriguez

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…

Performance · Computer Science 2020-08-18 Neil J. Gunther

In this paper, we consider five models of heavy-tailed queues involving Mittag-Leffler distributions that generalize the classical $M/M/1$ queues. These models are suitable modifications of previously defined models in such a way that the…

Probability · Mathematics 2026-02-19 Giacomo Ascione , Luigia Caputo

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…

Probability · Mathematics 2026-01-14 Andrew Daw , Jamol Pender

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…

Probability · Mathematics 2021-07-29 Barbara Margolius

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…

Probability · Mathematics 2025-08-28 Hoang Huy Nguyen , Sushil Mahavir Varma , Siva Theja Maguluri

We investigate an M/M/1 queue operating in two switching environments, where the switch is governed by a two-state time-homogeneous Markov chain. This model allows to describe a system that is subject to regular operating phases alternating…

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…

Probability · Mathematics 2014-12-10 Charles Knessl , Johan S. H. van Leeuwaarden

In this work, nonparametric statistical inference is provided for the continuous-time M/G/1 queueing model from a Bayesian point of view. The inference is based on observations of the inter-arrival and service times. Beside other…

Statistics Theory · Mathematics 2017-03-22 Cornelia Wichelhaus , Moritz von Rohrscheidt

This paper presents a method for calculating steady state probabilities of $M|E_r|c|K$ queueing systems. The infinitesimal generator matrix is used to define all possible states in the system and their transition probabilities. While this…

Systems and Control · Computer Science 2014-01-21 Stefan Hochrainer , Ronald Hochreiter , Georg Pflug

We study three non-equivalent queueing models in continuous time that each generalise the classical M/M/1 queue in a different way. Inter-event times in all models are Mittag-Leffler distributed, which is a heavy tail distribution with no…

Probability · Mathematics 2022-11-24 Jacob Butt , Nicos Georgiou , Enrico Scalas

We consider a stationary Markov process that models certain queues with a bulk service of a fixed number $m$ of admitted customers. We find an integral expression of its transition probability function in terms of certain multi-orthogonal…

Probability · Mathematics 2023-08-29 Ulises Fidalgo

We relate the convergence of time-changed processes driven by fractional equations to the convergence of corresponding Dirichlet forms. The fractional equations we dealt with are obtained by considering a general fractional operator in…

Probability · Mathematics 2019-10-24 Raffaela Capitanelli , Mirko D'Ovidio

This paper calculates transient distributions of a special class of Markov processes with continuous state space and in continuous time, up to an explicit error bound. We approximate specific queues on R with one-sided L\'evy input, such as…

Probability · Mathematics 2025-04-03 Fabian Michel , Markus Siegle
‹ Prev 1 2 3 10 Next ›