Markov chains and queueing theory together provide a robust framework for analysing systems that evolve randomly over time. Markov chains describe stochastic processes where the future state depends ...

We consider single-server queueing systems that are modulated by a discrete-time Markov chain on a countable state space. The underlying stochastic process is a Markov random walk (MRW) whose ...

Polling systems and queueing theory constitute a significant branch of applied mathematics that underpins various modern technological and industrial applications. These areas investigate systems ...

RUDN University mathematicians created a model of maximum efficiency of data centers. It is based on a nontrivial Markov chain. In addition to the obvious practical applications of the results for the ...

Journal of Applied Probability, Vol. 27, No. 3 (Sep., 1990), pp. 557-576 (20 pages) In this paper we consider two-dimensional Markov chains with the property that, except for some boundary conditions, ...