Related papers: Erlang Redux: An Ansatz Method for Solving the M/M…
We use an Ornstein--Uhlenbeck (OU) process to approximate the queue length process in a $GI/GI/n+M$ queue. This one-dimensional diffusion model is able to produce accurate performance estimates in two overloaded regimes: In the first…
Recently, Atar and Miyazawa [2] introduced a multi-level GI/G/1 queue with a finite number of levels, where both the arrival and service rates depend on the level corresponding to the current queue length. For this model, they proved that…
Lindley's equation is an important relation in queueing theory and network calculus. In this paper, we develop a new method to solve one type of Lindley's equation, i.e., the equation V(s)T(-s)-1=0 only has finite negative real roots. V(s)…
A notorious problem in queueing theory is to compute the worst possible performance of the GI/G/1 queue under mean-dispersion constraints for the interarrival and service time distributions. We address this extremal queue problem by…
In this paper we study a representation problem first considered in a simpler version by Bank and El Karoui [2004]. A key ingredient to this problem is a random measure $\mu$ on the time axis which in the present paper is allowed to have…
We investigate the steady-state diffusion-approximation error for continuous-time queueing systems with generally distributed primitives. Across four canonical systems -- the $G/G/1$ and $G/M/\infty$ queues, the join-the-shortest-queue…
In this paper, we introduce a new approach to solving the porous medium equation using a moving mesh finite element method that leverages the Onsager variational principle as an approximation tool. Both the continuous and discrete problems…
In this note we consider M/D/1/N queue with renovation and derive analytic expressions for the following performance characteristics: stationary loss rate, moments of the number in the system. Moments of consecutive losses, waiting/sojourn…
In queueing systems, effective scheduling algorithms are essential for optimizing performance. Optimal scheduling for the M/G/k queue has been explored in the heavy traffic limit, but much remains unknown in the intermediate load regime. In…
This work develops a methodology for studying the effect of an offload zone on the ambulance ramping problem using a multi-server, multi-class non-preemptive priority queueing model that can be treated analytically. A prototype model for…
Markov Chain Monte Carlo methods for sampling from complex distributions and estimating normalization constants often simulate samples from a sequence of intermediate distributions along an annealing path, which bridges between a tractable…
New recursive equations designed for the G/G/m queue are presented. These equations describe the queue in terms of recursions for the arrival and departure times of customers, and involve only the operations of maximum, minimum and…
We consider the $M/M/1$ queue with processor sharing. We study the conditional sojourn time distribution, conditioned on the customer's service requirement, in various asymptotic limits. These include large time and/or large service…
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…
Energy-based models provide a natural bridge between statistical physics and machine learning by representing data through structured energy landscapes. Boltzmann machines are a particularly compelling class of such models for capturing…
We propose a unified approach to establishing diffusion approximations for queues with impatient customers within a general framework of scaling customer patience time. The approach consists of two steps. The first step is to show that the…
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…
We consider a single-server queue where interarrival and service times depend linearly and randomly on customer waiting times, and establish a sample-path moderate deviation principle (MDP) for the waiting time process. The waiting times…
In this paper we study a one-dimensional random motion by having a general Erlang distribution for the sojourn times of the switching process and we obtain solution of the four order hyperbolic PDE for 2-Erlang case.
We introduce and study some queueing models with random resetting, including Markovian and non--Markovian models. The Markovian models include M/M/$\infty$, M/M/r and M/M/1+M queues with random resetting, in which a continuous-time Markov…