### Table 1: Equilibrium state probabilities associated with the single-server and in nite-server queues.

"... In PAGE 3: ... When n = 1 it can be shown that if the arrival times and durations are as in (A1) and (A2), then the defacto service times will be exponentially distributed with parameter + [10]. It is also equally well known that the equilibrium state probabilities fpk : k 0g of a (MjMj1) queue are geometrically distributed, while for a (MjMj1) queue they are Poisson distributed (see Table1 ). In our case, the (MjMj1) is also ergodic since lt; 1, while the (MjMj1) queue is known to always be er- godic [1].... In PAGE 3: ... In our case, the (MjMj1) is also ergodic since lt; 1, while the (MjMj1) queue is known to always be er- godic [1]. In order to relate the exosystem process, N(t), to the Markovian model in [8], de ne the (state) events disturbance absent and disturbance exists, re- spectively, as A := fN(t) = 0g E := fN(t) gt; 0g; and the corresponding transition events A 7! E := fN(t + t) gt; 0jN(t) = 0g E 7! A := fN(t + t) = 0jN(t) gt; 0g: The equilibrium state probabilities are trivially de- termined and shown in Table1 . The transition prob- ability rates can be shown to be: AE = 0 EA = 1 p1 1 ? p0 ; which reduce to the expressions given in Table 2 for the speci c processes we are considering.... In PAGE 5: ...1 We consider the rare event scenario discussed in the previous section, where is taken to be small relative to . According to Table1 , pk 0 for k gt; 1, and thus the nite state Markov chain ^ (i) has ` = 2 k = 4 states. In Kronecker notation, the corresponding transition probability matrix is ^ P = 1 ? T T T 1 ? T 1 1 1 1 diag(1 ? p 0; p 0; 1 ? p 1; p 1): We next make the simplifying assumptions that p 0 = 0, p 1 = 1, and A0 = A1 = A2, so that A1 = 2 4 (1 ? T)(A0 A0) (1 ? T)(A0 A0) 0 0 0 0 T(A0 A0) T(A0 A0) T(A0 A0) T(A3 A3) 0 0 0 0 (1 ? T)(A0 A0) (1 ? T)(A3 A3) 3 5 : Now consider the rst order case, n = 1, where a0 := A0 and a3 := A3.... ..."

### Table 1: Response time variances of a queueing network with general service times at the entry node and two asymmetrically loaded single-server service nodes.

"... In PAGE 9: ... Finally, we changed the service distribution at the entry node. Table1 shows the results for a variety of parameters, where the coefficient of variation for the service times at the entry nodes is varied between 0 (deterministic), 4 and 16 (Gamma distribution). These results are extended in Table 2 with multi-server service nodes.... ..."

### Table 1. Response time variances of a queueing network with general service times at the entry node and two asymmetrically loaded single-server service nodes.

"... In PAGE 9: ...ntry nodes exponential. Both cases yielded relative errors smaller than 6%. Finally, we changed the service distribution at the entry node. Table1 shows the results for a variety of parameters, where the coefficient of variation for the service times at the entry nodes is varied between 0 (deterministic), 4 and 16 (Gamma distribution). These results are extended in Table 2 with multi- server service nodes.... ..."

### Table 1: Average Risk of Classical Bootstrap and Proposed Bayesian Estimators for Average Sojourn Time in a Single Server Queue

"... In PAGE 8: ... ={z1, z2,...,zn} is the observed sample of service times. Table1 shows the results for the average risk in es- timating the posterior mean response. It appears that the Bayesian point estimator averages a slightly smaller risk in all cases.... ..."

### Table 1: Example 5.1|A small network of single-server stations

1998

"... In PAGE 15: ... Example 5.1: (See Table1 .) This network has three single-server stations and one IS station.... ..."

Cited by 2

### Table 3: Example 5.3|A network with single-server FS stations in critical usage

1998

"... In PAGE 16: ... Example 5.3: (See Table3 .) This network is as in example 5.... ..."

Cited by 2

### Table 7.1: Waiting times for a single-queue, single-server system. FIFO server discipline.

1993

Cited by 21

### Table 7.2: Waiting times for a single-queue, single-server system. FIFO server discipline.

1993

Cited by 21

### Table 7.4: Waiting times for a single-queue, single-server system. FIFO server discipline.

1993

Cited by 21

### Table 7.6: Waiting times for a single-queue, single-server system. FIFO server discipline.

1993

Cited by 21