### Table 5.1: Data for the maps shown in the gures. A: number of schematic paths when shared departure is not allowed. B: number of schematic paths

1977

### Table 1. Examples of Route Directions

"... In PAGE 10: ... We obtained a total of 29 maps and 21 directions. Sam- ple descriptions appear in Table1 and sample maps in Figures 1. Note that route maps differ from other kinds of sketch maps in that they contain only the paths and landmarks relevant to the specific route.... In PAGE 14: ... According to forward progression, the direction of motion is assumed to be forward. The first protocol in Table1 lacks any end points, yet they can be easily inferred from the subsequent action. This protocol has only one explicit mention of forward progression, at the end ( quot;go down few miles quot;); rather, the forward progression is implicit.... ..."

### Table 1: Results with the shortest paths, and 2- and 3- multi- path routes together with the respective single-path routes.

"... In PAGE 5: ...maximumfluxof0:3763 , i.e., the flux corresponding to the outer radial-ring paths at the boundary. The numerical results are given in Table1 , where rows indicated with 1) and 2) correspond to the optimal weights for randomized path selection with the given two and three path sets, respectively, and column multi-path con- tains the corresponding maximum scalar fluxes. However, according to Proposition 1, multi-path routes mp1 and mp2 cannot be an optimal solution to the load balancing problem, and, in particular, the corresponding single-path routes, denoted by sp1 and sp2, obtained using (14) yield a lower maximum scalar packet flux.... In PAGE 5: ... However, according to Proposition 1, multi-path routes mp1 and mp2 cannot be an optimal solution to the load balancing problem, and, in particular, the corresponding single-path routes, denoted by sp1 and sp2, obtained using (14) yield a lower maximum scalar packet flux. This maximum scalar flux can be computed numer- ically and the corresponding results are given in column single- path in Table1 . We note that in both cases combining the multi- path traffic flows to single-path improves the situation considerably, as expected.... In PAGE 6: ...4 0.5 sp1 sp3 mod (r) r modified sp1 sp3 circular (2 path sets) (3 path sets) Figure 5: Resulting scalar flux as a function of distance r from the origin for modified circular paths (see [12]), and the optimal single-path routes sp1 and sp3 (rows 1) and 3) in Table1 ). Three dimensional plots illustrate the same situation.... ..."

### TABLE I ROUTING TABLES FOR AS PATH INFERENCE

2005

Cited by 2

### Table 1. Routing paths in 3-dimensional ORLS

### Table 2: Average Internode Distance: SHORT=Shortest Path Routing, MULT=Multistage Routing, S/M = Ratio of Shortest Path Routing to Multistage Routing

1995

"... In PAGE 8: ...3 Results and Analysis In our experiments, we use the system size 64, 128, and 256 with switch sizes 4, 8, and 16. The average internode distances of single stage networks for shortest path routing and multistage routing are shown in Table2 . The column SHORT and MULT show the average internode distance of shortest path routing and that of multistage routing, re- spectively.... In PAGE 9: ... The improvements varies de- pending on di erent benchmarks. However, we can nd a close relation between the S/M ratios in the Table2 and Table 3. The ratios can not be the same because the read miss latency ratios in Table 3 contain the delay caused by memory access as well as network itself, whereas the S/M ratios in Table 2 re ect only network e ects.... In PAGE 9: ... However, we can nd a close relation between the S/M ratios in the Table 2 and Table 3. The ratios can not be the same because the read miss latency ratios in Table 3 contain the delay caused by memory access as well as network itself, whereas the S/M ratios in Table2 re ect only network e ects. The mem- ory access delay is relatively constant and independent of the routing schemes.... In PAGE 9: ... For example, the S/M ratio of MDG is af- fected the most by the memory access delays. This is the reason why the S/M ratios of MDG and the S/M ratio in Table2 shows bigger di erences than in other benchmarks. MDG has a hot spot memory access pattern so that mem- ory access time is a dominant delay component in read miss latency.... ..."

Cited by 2

### Table 3: Schematic view of rules following the analysis of exemplary taxa in Figure 1. Rule No. Rule syntax

in Contents

"... In PAGE 32: ...nd B. This is done by direct event-controlled sampling in the entry routes. Measurements in the stream would not reveal small amounts of contamination, owing to dilution in the large volume of water. Table3 : Linear regression to explain the loads in the individual entry routes either by the amount applied or the Ko/w value for each pesticide. Dependent variable Independent variable r2 p B SE B n Log (farmyard runoff) Log (amount applied) 0.... ..."

### Table 3: Alternate routing algorithms: routing type and brief summary of selected route Algorithm name Routing Type Selected route (brief summary) Shortest Path Fixed minimum hop count

in A Study on Routing Algorithms with Delayed Link State Information for Distributed Lightpath Network

2002

"... In PAGE 20: ... Table3 summarizes the routing algorithms we used in our simulations. With the shortest path (SP) algorithm, the sender node repeatedly selects the shortest path that has the minimum hop counts.... ..."

### Table 1: Average path length for different routing protocols and network sizes

"... In PAGE 3: ...20000 packets to the victim to obtain total number of paths traversed by the packets, length of each path and calculated the average. The average lengths are presented in Table1 . Using AODV, the packets traversed through only 1 path, whereas for DSDV, multiple paths were selected as the traffic load increased.... ..."