### Table 2 shows the results for all difierent sets and topologies. The results reported are the overall through- 251

in Performance Evaluation and Optimization of Open Zero-Buffer Abstract Multi-Server Queueing Networks

"... In PAGE 9: ...Table2... In PAGE 10: ...Table2 goes around here In order to evaluate the solution quality of the GEM, we set up a simulation experiment of four selected 257 cases in the series, merge, and split topologies. We used an observation period of 200,000 time unit and a 258 warm-up period of 2,000 time units for 20 independent replications.... In PAGE 18: ...481 Figure 1: The three difierent blocking mechanisms 482 Figure 2: A zero-bufier queueing network representation 483 Figure 3: The generalized expansion method 484 Figure 4: Series topology 485 Figure 5: Split topology 486 Figure 6: Merge topology 487 Figure 7: GA optimization for earmarked symmetrical settings 488 Figure 8: GA optimization for earmarked asymmetrical settings 489 Figure 9: Queueing network structure 490 Figure 11: GA optimization for the fruit juice plant 491 Figure 10: Plot of throughput for difierent arrival rates 492 Figure 12: New queueing network structure 493 Table Legends 494 Table 1: Variables used in this paper 495 Table2 : Throughput for the symmetrical cases 496 Table 3: Simulation results for the symmetrical cases 497 Table 4: Throughput for the asymmetrical cases. 498 Table 5: Simulation results for the asymmetrical cases 499 Table 6: Processing rates used in the complex topology 500 Table 7: Data used in the complex topology 501 Table 8: Throughput rates for difierent conflgurations 502... ..."

### Table 1 Properties of network topologies.

"... In PAGE 4: ...5 Experimental procedures for Internet-04. must be within the number of single degree nodes, which is shown in Table1 . Next, root routers and sets of destination routers were selected uniformly and randomly, multicast de- livery trees were constructed, and the metrics were calcu- lated while varying island radius.... ..."

### Table 1. Topology configurations and characteristics

2003

"... In PAGE 8: ...onstant for the analysis, i.e. the number of bi-directional ports is 16, one traffic flow is associated with each input port, and the single SDRAM uses separate buses for read and write accesses. Topologies using eight processing elements are listed in Table1 together with static design characteristics. The first four topologies (I - IV) are also shown in Figure 1.... In PAGE 9: ...2. Results from analysis Given the topology configurations in Table1 analy- sis results from abstract benchmarking are given in Figure 5. The arrival rate of packets is fixed to the point where the modeled SDRAM reaches saturation in utiliza- tion.... In PAGE 10: ... The latter configurations more realistically model run-time jitter and arbitration effects as well as effects due to slightly unbalanced task graphs since a fully synchronous design is not feasible in our application domain. Note that the worst-case memory bounds given in Table1 for packet descriptors do not hold in the plain Round-Robin case in Figure 5. We would consider those designs to be unbal- anced for our application scenario since, for instance, in the pure pipeline case, up to 18 packets per flow could be in the network processor concurrently (as opposed to up to nine packets in Table 1).... In PAGE 10: ... Note that the worst-case memory bounds given in Table 1 for packet descriptors do not hold in the plain Round-Robin case in Figure 5. We would consider those designs to be unbal- anced for our application scenario since, for instance, in the pure pipeline case, up to 18 packets per flow could be in the network processor concurrently (as opposed to up to nine packets in Table1 ). Only under ideal assumptions the pure pipeline (con- figuration (1)) is able to match latency values with pool configurations (configuration (IV and V)) by over- provisioning the throughput of point-to-point (P-2-P) connections and thereby decreasing the transport delay.... ..."

Cited by 10

### Table 1. Comparison of results for various approaches.

"... In PAGE 8: ... 4. Numerical Results Table1 compares the balance and uniformity (t,s) of (n,2) de Bruijn sequences... In PAGE 9: ... In the case of Algorithm II, the characteristics of the sequences obtained by the optimal mappings with respect to both balance and uniformity criteria are shown. ------------------------- Table1 goes here ------------------------- In Table 1, we observe that: 1. Although Algorithm I generates sequences with optimal uniformity (minimum s), the corresponding balance criterion t is rather large.... In PAGE 9: ... In the case of Algorithm II, the characteristics of the sequences obtained by the optimal mappings with respect to both balance and uniformity criteria are shown. -------------------------Table 1 goes here ------------------------- In Table1 , we observe that: 1. Although Algorithm I generates sequences with optimal uniformity (minimum s), the corresponding balance criterion t is rather large.... ..."

### Table 1. Radio characteristics.

2000

"... In PAGE 6: ... This will depend on sev- eral parameters, such as the network topology and the rela- tive costs of computation versus communication. We sim- ulated the LEACH protocol for the random network shown in Figure 3 using the radio parameters in Table1 and a com- putation cost of 5 nJ/bit/message to fuse 2000-bit messages while varying the percentage of total nodes that are cluster- heads. Figure 8 shows how the energy dissipation in the system varies as the percent of nodes that are cluster-heads is changed.... ..."

Cited by 669

### Table 1. Radio characteristics.

2000

"... In PAGE 6: ... This will depend on sev- eral parameters, such as the network topology and the rela- tive costs of computation versus communication. We sim- ulated the LEACH protocol for the random network shown in Figure 3 using the radio parameters in Table1 and a com- putation cost of 5 nJ/bit/message to fuse 2000-bit messages while varying the percentage of total nodes that are cluster- heads. Figure 8 shows how the energy dissipation in the system varies as the percent of nodes that are cluster-heads is changed.... ..."

Cited by 669

### Table 1. Radio characteristics.

2000

"... In PAGE 6: ... This will depend on sev- eral parameters, such as the network topology and the rela- tive costs of computation versus communication. We sim- ulated the LEACH protocol for the random network shown in Figure 3 using the radio parameters in Table1 and a com- putation cost of 5 nJ/bit/message to fuse 2000-bit messages while varying the percentage of total nodes that are cluster- heads. Figure 8 shows how the energy dissipation in the system varies as the percent of nodes that are cluster-heads is changed.... ..."

Cited by 669

### Table 2: Technology Mapping results

"... In PAGE 8: ... The results show that the Boolean approach reduces the number of matching algorithm calls, nd smaller area circuits in better CPU time, and reduces the initial network graph because generic 2-input base function are used. Table2 presents a comparison between SIS and Land for the library 44-2.genlib, which is distributed with the SIS package.... ..."

### Table 5.1 Network topologies in the simulation Between ASs Within an AS Topologies

2003

Cited by 2

### Table 1 shows the elements that a graph is composed of and the main options for the semantics associated with a graph. Decomposition or modularization of a complex system into more manageable (and reusable) components is a well-recognized requirement. This requirement is likely to be of particular importance in graphical notations which inevitably occupy more space than compact textual representations. VPPLs can support this requirement by permitting one graph to be composed from other (sub-)graphs. Visual complexity can then be reduced by permitting a node on one graph to refer to a sub-graph constructed separately. This feature also permits graph-reuse (c.f. code reuse), a useful feature in itself for the usual reasons.

"... In PAGE 4: ... - 4 - Composed of Sub-Graphs Nodes Arcs Graph Semantics Options Structure Node dependencies Recursion Directed Cyclic Directed Acyclic Visible Invisible Permitted Not Permitted Table1 . Graph Elements and Semantics When sub-graphing is permitted the VPPL will need to provide (visual) means for expressing the way in which connections represented on the parent graph are reflected onto connections in the sub-graph.... ..."

Cited by 1