Improved Bounds on the Rate of Convergence to Stationarity of the M/M/N Queue as Both the Number of Servers and the Arrival Rate Grow Large

Consideration is given to the stable M/M/N/∞ queueing system as both the arrival rate and the number of servers tend to infinity, including the Halflin–Whitt regime. One is interested in the asymptotic behavior of the rate of convergence to stationarity of the total number of customers in the system. Bounds for the rate of convergence are provided, which improve upon those available in the literature. The derivations, simpler than those available in the literature, are based on the well-known logarithmic norm method. It is also shown that the obtained results can be adopted to M/M/N/N+R queues as well.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2026-10-28
DOI
https://doi.org/10.3390/math14213932
Primary Topic
Advanced Queuing Theory Analysis
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Improved Bounds on the Rate of Convergence to Stationarity of the M/M/N Queue as Both the Number of Servers and the Arrival Rate Grow Large

Yacov Satin, Alexander I. Zeifman, Rostislav Razumchik
Mathematics
Advanced Queuing Theory Analysis
article

Improved Bounds on the Rate of Convergence to Stationarity of the M/M/N Queue as Both the Number of Servers and the Arrival Rate Grow Large

Yacov Satin, Alexander I. Zeifman, Rostislav Razumchik
article en

Abstract

Consideration is given to the stable M/M/N/∞ queueing system as both the arrival rate and the number of servers tend to infinity, including the Halflin–Whitt regime. One is interested in the asymptotic behavior of the rate of convergence to stationarity of the total number of customers in the system. Bounds for the rate of convergence are provided, which improve upon those available in the literature. The derivations, simpler than those available in the literature, are based on the well-known logarithmic norm method. It is also shown that the obtained results can be adopted to M/M/N/N+R queues as well.

MathematicsVol. 14(21)
Vologda State University (RU), Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences (RU)
Ministry of Science and Higher Education of the Russian Federation
Openalex Percentile: Top 6%
Advanced Queuing Theory Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon