Ergodic Theorem for a~Queue with Unreliable Server
Matematičeskie zametki, Tome 97 (2015) no. 6, pp. 803-814
Voir la notice de l'article provenant de la source Math-Net.Ru
A single server queue with unreliable server is considered. The server breakdown probability depends on the state of a random medium described by a Markov chain. An ergodic theorem is proved for this system.
Keywords:
regenerative flow, unreliable server, ergodicity, limit theorems, random medium.
Mots-clés : Markov chain
Mots-clés : Markov chain
@article{MZM_2015_97_6_a0,
author = {S. Zh. Aibatov},
title = {Ergodic {Theorem} for {a~Queue} with {Unreliable} {Server}},
journal = {Matemati\v{c}eskie zametki},
pages = {803--814},
publisher = {mathdoc},
volume = {97},
number = {6},
year = {2015},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_2015_97_6_a0/}
}
S. Zh. Aibatov. Ergodic Theorem for a~Queue with Unreliable Server. Matematičeskie zametki, Tome 97 (2015) no. 6, pp. 803-814. http://geodesic.mathdoc.fr/item/MZM_2015_97_6_a0/