Research indexJournal article
Diffusion Approximation Error for Queueing Systems with General Primitives
Braverman, Scully
Operations Research30 Oct 2026Open access
Diffusion Approximation Error for Queueing Systems with General Primitives
Braverman, Scully · Operations Research · 2026
Abstract
How Accurate Are Diffusion Approximations for Queues with General Distributions? Diffusion approximations are widely used to analyze complex queueing systems, but their accuracy is often best understood when arrival and service times follow exponential distributions. Braverman and Scully study what happens when these assumptions are relaxed. Their paper, “Diffusion Approximation Error for Queueing Systems with General Primitives,” develops a framework for quantifying steady-state approximation error across a broad class of arrival and service distributions. Examining several canonical queueing models, the authors show that the error naturally separates into interior and boundary components. The interior error can generally be controlled using only the first three moments of the underlying distributions, whereas boundary effects require more model-specific analysis. Methodologically, the paper extends Stein’s method to piecewise-deterministic Markov processes, providing new tools for analyzing systems with general renewal processes and broadening the range of queueing models for which rigorous diffusion-approximation guarantees can be obtained.