Several types of convergence rates of the \(M/G/1\) queueing system

DOI10.1155/2013/809460zbMath1264.90060OpenAlexW2012467867WikidataQ58921876 ScholiaQ58921876MaRDI QIDQ1956118

Xiaohua Li, Jun-Gang Li

Publication date: 13 June 2013

Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/809460

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Cites Work

• Ergodicity of quasi-birth and death processes. I
• Necessary conditions for geometric and polynomial ergodicity of random-walk-type Markov chains
• Polynomial convergence rates of Markov chains
• Practical drift conditions for subgeometric rates of convergence.
• Rate of convergence for ergodic continuous Markov processes: Lyapunov versus Poincaré
• Subgeometric Rates of Convergence of f-Ergodic Markov Chains
• 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
• Light-tailed asymptotics of stationary probability vectors of Markov chains of GI/G/1 type
• Several Types of Ergodicity for M/G/1-Type Markov Chains and Markov Processes
• Heavy-tailed asymptotics of stationary probability vectors of Markov chains of gi/g/1 type