Table 3 Transitions from a reference state k = [k 0 ,…, k 2 ]
Activity | Rate | Destination state |
|---|---|---|
A PU arrives to the system and there are enough resources in order to be served without interrupting a SvU. | a 0(k) | (k + e 0) |
A SvU arrives to the system without interrupting a SdU, or SdUs are interrupted and buffered. | a 1(k) | (k + e 1) |
A SdU arrives to the system and there are at least b min resources available. | a 2(k) | (k + e 2) |
A PU terminates its service and leaves the system. | b 0(k) | (k − e 0) |
A SvU terminates its service and leaves the system. | b 1(k) | (k − e 1) |
A SdU terminates its service and leaves the system. | b 2(k) | (k − e 2) |
A PU arrives to the system and interrupts j SvUs. | c(k) | (k + e 0 − j e 1) |