### Table 2 Queueing Network Model

"... In PAGE 18: ... Finally notice that PEPS requires exactly the same amount of time even though the reachable state space ranges from large to small. Table2 shows the results for the queueing network example. The descriptor is com- posed of 3 tensor terms without functions, and 3 tensor terms with a single functional factor when 2 is constant.... ..."

### Table 6 Queueing Network Model

"... In PAGE 17: ... A grouping of the automata according to queue (A1 and A2) and (A31 and A32); The second grouping allows for the possibility of a reduction in the state space of the joint automata, (A31 and A32), since the priority queue is now represented by a single automaton. The results obtained are presented in Table6... ..."

### Table 4 Queueing Network Model

"... In PAGE 23: ... A grouping of the automata according to queue (A1 and A2) and (A31 and A32); The second grouping allows for the possibility of a reduction in the state space of the joint automata, (A31 and A32), since the priority queue is now represented by a single automaton. The results obtained are presented in Table4 and Figure 8. The last column of Table 4 shows the results for 1 group, thus the sparse method.... In PAGE 23: ... The results obtained are presented in Table 4 and Figure 8. The last column of Table4 shows the results for 1 group, thus the sparse method.... ..."

### Table 4.3.1 Tabulation of closed network of queues model

2004

Cited by 1

### Table 5: The average queue lengths of the queueing network

2002

"... In PAGE 28: ... The iterations, along with the refined Brownian estimates, are given in Table 8 to 10. The case n = 1 corresponds the original Brownian model whose results are shown in Table5 to 7. By observing the numerical results in Table 8 to 10, we can see that the above iterative procedure provides a slightly better Brownian model for performance evaluation compared to the original Brownian model, especially in System No.... ..."

Cited by 3

### Table 6: The average throughput rates of the queueing network

2002

Cited by 3

### Table 1: Operations on the queue during the network partition

1996

"... In PAGE 2: ... Suppose that the network is partitioned into two parts, P1 and P2. Table1 lists the operations on the queue while the network is partitioned. We assume that the queue contains two data items #3C 0; 1 #3E before the network is partitioned.... In PAGE 2: ... We assume that the queue contains two data items #3C 0; 1 #3E before the network is partitioned. The #0Crst column of Table1 shows the global sequence of all operations while the network is par- titioned. The second column shows the operations in partition P1 and the third column shows the states of the queue in partition P1.... ..."

Cited by 1

### Table 1. A comparison of approximations with simulation estimates at queues 9 and 8 in the tandem network of nine queues in Section 6.

1995

"... In PAGE 23: ...approximation (11) with r = 2 in Table1 as well. Upon reflection, it seems unreasonable to expect great accuracy for approximations with the heavy-traffic bottleneck phenomenon.... ..."

Cited by 6

### Table 3. Parameters for generating single class separable queueing networks

2000

"... In PAGE 9: ... We chose single class separable queueing networks because it is feasible to obtain the exact solution of such networks. The parameters used to generate the random networks in each of these experiments are given in Table3 . The detailed experimental results for these ve experiments are presented elsewhere [16].... ..."

Cited by 2