Unreliable queueing systems
We analyze an unreliable queueing system that services customers. The service facility may have one or more identical servers that are subject to random breakdowns and repairs. The infinitesimal generator of the underlying Markov process has a block tri-diagonal structure. We demonstrate the computational tractability of an unreliable queueing system by the matrix geometric method.
scientific article; zbMATH DE number 3984933
scientific article