Simple proof of Dynkin's formula for single-server systems and polynomial convergence rates

zbMath1309.60091arXiv1306.2359MaRDI QIDQ2940158

Alexander Yu. Veretennikov, G. A. Zverkina

Publication date: 26 January 2015

Full work available at URL: https://arxiv.org/abs/1306.2359

zbMATH Keywords

convergence ratesingle-server queueDynkin's formulastationary regime

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (6)

On Strong Bounds of Rate of Convergence for Regenerative Processes ⋮ On some extended Erlang-Sevastyanov queueing system and its convergence rate ⋮ Exponential Convergence of Degenerate Hybrid Stochastic Systems with Full Dependence ⋮ On the exponential convergence rate of the distribution for some nonregenerative reliability system ⋮ On the rate of convergence for infinite server Erlang-Sevastyanov's problem ⋮ On mean-field (\(\mathrm{GI}/\mathrm{GI}/1\)) queueing model: existence and uniqueness

This page was built for publication: Simple proof of Dynkin's formula for single-server systems and polynomial convergence rates