Non-ergodicity criteria for denumerable continuous time Markov processes.
From MaRDI portal
Publication:703284
DOI10.1016/j.orl.2004.03.001zbMath1067.60067MaRDI QIDQ703284
Publication date: 11 January 2005
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2004.03.001
60J25: Continuous-time Markov processes on general state spaces
90B22: Queues and service in operations research
90C40: Markov and semi-Markov decision processes
Related Items
Tests for nonergodicity of denumerable continuous time Markov processes, Delay analysis of extended rtPS for VoIP service in IEEE 802.16e by matrix analytic method, Stability of a priority queueing system with customer transfers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Continuous-time Markov chains. An applications-oriented approach
- Ergodicity of the BMAP/PH/s/s+K retrial queue with PH-retrial times
- A matrix continued fraction algorithm for the multiserver repeated order queue.
- Technical Note—Mean Drifts and the Non-Ergodicity of Markov Chains
- On sufficient conditions for ergodicity of multichannel queueing systems with repeated calls
- Tests for the Nonergodicity of Multidimensional Markov Chains
- A sufficient condition of nonergodicity of a Markov chain (Corresp.)
- Criteria for ergodicity, exponential ergodicity and strong ergodicity of Markov processes
- Sufficient conditions for regularity, recurrence and ergodicity of Markov processes
- The map/ph/1 retrial queue
- Retrial Queues
- Some Conditions for Ergodicity and Recurrence of Markov Chains