Computing the stationary distributions of a continuous-time Markov chain (CTMC) involves
solving a set of linear equations. In most cases of interest, the number of equations is infinite …

The stochastic dynamics of biochemical networks are usually modeled with the chemical
master equation (CME). The stationary distributions of CMEs are seldom solvable …

This paper analyzes the dynamics of a level-dependent quasi-birth–death process X={(I (t), J
(t)): t≥ 0}, ie, a bi-variate Markov chain defined on the countable state space∪ i= 0∞ l (i) …

Stationary expectations corresponding to long-run averages of additive functionals on level-
dependent quasi-birth-and-death processes are considered. Special cases include long-run …

The infinitesimal generator matrix underlying a multidimensional Markov chain can be
represented compactly by using sums of Kronecker products of small rectangular matrices …

OpenFlow supports internal buffering of data packets in Software-Defined Networking (SDN)
switch whereby a fraction of data packet header is sent to the controller instead of an entire …

Online service providers aim to satisfy the tail performance requirements of customers
through Service-Level Objectives (SLOs). One approach to ensure tail performance …

The ability to obtain the steady-state probability distribution of a Markov chain is invaluable
for modern service providers who aim to satisfy arbitrary tail performance requirements …

Markovian systems with multiple interacting subsystems under the influence of a control unit
are considered. The state spaces of the subsystems are countably infinite, whereas that of …

We consider a Markovian multiserver queueing system with two customer classes,
preemptive priorities, and reneging. We formulate this system as an infinite level-dependent …