Article contents
Conditions for the non-ergodicity of Markov chains with application to a communication system
Published online by Cambridge University Press: 14 July 2016
Abstract
We obtain a sufficient condition for the transience of a Markov chain, and a sufficient condition for its null recurrence. These are applied to characterize the stability of a multiple-access communication system. Performance bounds for the system are also obtained.
- Type
- Research Papers
- Information
- Copyright
- Copyright © Applied Probability Trust 1987
References
- 4
- Cited by