Processing Networks XVI: The Foster–Lyapunov Criterion for Continuous-Time Markov Chains with Bounded Transition RatesTextbook
Stability of a queueing or processing network is usually established by representing the network as a continuous-time Markov chain (CTMC) on a countable state space and showing that the chain is positive recurrent. Direct computation of a stationary distribution is rarely possible, so the working tool is a Foster–Lyapunov criterion: exhibit a non-negative…