Explicit convergence rates of the embedded \(\mathrm{M}/\mathrm{G}/1\) queue

DOI10.1007/S10114-005-0917-6zbMath1120.60088OpenAlexW1999657859MaRDI QIDQ2644357

Yanyan Li

Publication date: 31 August 2007

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-005-0917-6

zbMATH Keywords

Markov chainsqueuesconvergence rategeometric ergodicitypolynomial ergodicity

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items (2)

Explicit convergence rates for the \(M/G/1\) queue under perturbation ⋮ Several Types of Ergodicity for M/G/1-Type Markov Chains and Markov Processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Markov chains and stochastic stability
• Algebraic convergence for discrete-time ergodic Markov chains
• Computable bounds for geometric convergence rates of Markov chains
• On the moments of some first passage times for sums of dependent random variables
• Polynomial convergence rates of Markov chains
• Practical drift conditions for subgeometric rates of convergence.
• Polynomial ergodicity of Markov transition kernels.
• Subgeometric Rates of Convergence of f-Ergodic Markov Chains
• Rates of convergence of stochastically monotone and continuous time Markov models
• Explicit criteria for several types of ergodicity of the embedded M/G/1 and GI/M/n queues
• Geometric Convergence Rates for Stochastically Ordered Markov Chains
• On the Existence of Moments for the Busy Period in a Single-Server Queue

This page was built for publication: Explicit convergence rates of the embedded \(\mathrm{M}/\mathrm{G}/1\) queue