Mathematics > Probability
[Submitted on 10 Nov 2025]
Title:Fluid Limits for Time-Varying Many-Server Queues with Finite Capacity
View PDF HTML (experimental)Abstract:This paper develops fluid limits for nonstationary many-server loss systems with general service-time distributions. For the zero-buffer $M_t/G/n/n$ queuing model, we prove a functional strong law of large numbers for the fraction of busy servers and characterize the limit by a nonlinear Volterra integral equation with discontinuous coefficients induced by instantaneous blocking. Well-posedness is established through an appropriate solution concept, yielding the time-varying acceptance probability without heuristic approximations. We then treat the finite-buffer $M_t/G/n/(n+b_n)$ regime, proving a functional strong law of large numbers for the triplet of fractions of busy servers, occupied buffers, and cumulative departures, whose limit satisfies a coupled system of three discontinuous Volterra equations capturing the interaction of service completions, buffer occupancy, and admission control at the capacity boundary. We establish well-posedness and convergence of the time-varying acceptance probability. Our theoretical results are supported by numerical simulations for both zero and finite-buffer regimes, illustrating the convergence of transient acceptance probabilities guaranteed by our theory. Finally, we use the fluid limits to derive optimal staffing and buffer-capacity for both time-varying loss systems.
References & Citations
export BibTeX citation
Loading...
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.