We briefly review the conditions that enable us to assert that the
CTMC described by the infinitesimal generator
in
Eq.(2.22) is stable, that is, admits a probability
vector satisfying
and
.
First observe that the matrix
is an infinitesimal generator, since it has zero row sums and
non-negative off-diagonal entries. The conditions for stability
depend on the irreducibility of matrix
.
If
is irreducible then there exists a unique positive
vector
that satisfies the equations
and
. In this case,
the stability condition for the M/G/1-type process with infinitesimal
generator
[69] is given by the following
inequality
In the example of the
queue depicted in Figure 3.3,
the infinitesimal generator
and its stationary probability vector
are
If
is reducible, then the stability condition
is different. By identifying the absorbing states in
, its state space can be rearranged as follows
This implies that each of the sets
for
is partitioned into subsets that communicate only through the boundary
portion of the process, i.e., states in
. The stability
condition in Eq.(3.41) should be satisfied by
all the irreducible blocks identified in Eq.(3.42) in order
for the M/G/1-type process to be stable as summarized below: