Related papers: A functional central limit theorem for the M/GI/$\…
Motivated by a web-server model, we present a queueing network consisting of two layers. The first layer incorporates the arrival of customers at a network of two single-server nodes. We assume that the inter-arrival and the service times…
Drone delivery systems violate a core assumption in classical queueing models: server capacity is not fixed. Drones (servers) periodically must recharge, creating random fluctuations in service availability. We introduce an Erlang--S$^{*}$…
We establish the averaging property for a queuing process with one server, M(t)/GI/1. It is a new relation between the output flow rate and the input flow rate, crucial in the study of the Poisson Hypothesis. Its implications include the…
We provide a functional central limit theorem for a broad class of smooth functions for possibly noncausal multivariate linear processes with time-varying coefficients. Since the limiting processes depend on unknown quantities, we propose a…
In this paper, we develop a stochastic algorithm based on Euler-Maruyama scheme to approximate the invariant measure of the limiting multidimensional diffusion of the $M/Ph/n+M$ queue. Specifically, we prove a non-asymptotic error bound…
We consider a single server queue which has a threshold to change its arrival process and service speed by its queue length, which is referred to as a two-level single server queue. This model is motivated by an energy saving problem for a…
We study fluctuations of mean-field interacting particle systems around their McKean--Vlasov limit. Our main result provides a uniform-in-time quantitative central limit theorem for the fluctuation process, with convergence rate of order…
We study the information-theoretic limit of reliable information processing by a server with queue-length dependent quality of service. We define the capacity for such a system as the number of bits reliably processed per unit time, and…
We consider a non-nestling random walk in a product random environment. We assume an exponential moment for the step of the walk, uniformly in the environment. We prove an invariance principle (functional central limit theorem) under almost…
The large-time behavior of a nonlinearly coupled pair of measure-valued transport equations with discontinuous boundary conditions, parameterized by a positive real-valued parameter $\lambda$, is considered. These equations describe the…
In traditional priority queues, we assume that every customer upon arrival has a fixed, class-dependent priority, and that a customer may not commence service if a customer with a higher priority is present in the queue. However, in…
In this paper we consider an M/G/1-type queue fed by a finite customer-pool. In terms of transforms, we characterize the time-dependent distribution of the number of customers and the workload, as well as the associated waiting times.
In this paper, we study the large--time behavior of a numerical scheme discretizing drift-- diffusion systems for semiconductors. The numerical method is finite volume in space, implicit in time, and the numerical fluxes are a…
We consider an infinite-server queue into which customers arrive according to a Cox process and have independent service times with a general distribution. We prove a functional large deviations principle for the equilibrium queue length…
We consider a GI/H/n queueing system. In this system, there are multiple servers in the queue. The inter-arrival time is general and independent, and the service time follows hyper-exponential distribution. Instead of stochastic…
We develop diffusion approximations for parallel-queueing systems with the randomized longest-queue-first scheduling algorithm by establishing new mean-field limit theorems as the number of buffers $n\to\infty$. We achieve this by allowing…
We establish a functional central limit theorem for Ripley's K-function for two classes of point processes. One is the class of point processes having exponential decay of correlations and further satisfying a conditional m-dependence…
A many-server queue operating under the earliest deadline first discipline, where the distributions of service time and deadline are generic, is studied at the law of large numbers scale. Fluid model equations, formulated in terms of the…
Inspired by the work of Atar and Miyazawa [1] (2026) as well as applications to energy-saving problems, we are interested in the heavy-traffic limit of the stationary queue length distribution, which is not addressed in [1]. In this paper,…
This is an expository review paper elaborating on the proof of the martingale functional central limit theorem (FCLT). This paper also reviews tightness and stochastic boundedness, highlighting one-dimensional criteria for tightness used in…