### TABLE IV. PEAK RATE, SUBSCRIBEDRATE AND PATH FOR THE CONNECTIONS IN THE NETWORK SCENARIO OF FIGURE 8 Connection Peak Rate Subscribed Path

### Table 4. Shared Backup Path Protection Problem Performance Parameters

"... In PAGE 14: ...# Variables Test ID # Paths SBPP PR 32LM 135 302 1,405 45LM 178 401 2,046 32HM 286 604 2,976 45HM 368 781 4,076 32LS 122 276 950 45LS 169 383 1,840 32HS 239 510 1,699 45HS 319 364 683 2,921 Table 3. Problem Characteristics for SBPP and PR Table4 illustrates that the majority of SBPP problems were not solved to optimality by either GDS or CPLEX within the 12 hour algorithm testing time limit. The star topologies appeared easier to solve.... ..."

### Table 3 Path Optimization

1999

"... In PAGE 17: ... The path studied here is uni-directional, which, to some extent, results in a low path utilization and system throughput. Table3 summarizes the works reviewed in the preceding paragraphs. 4.... ..."

Cited by 1

### Table 8: Connection performance.

### Table 8: Connection performance.

### Table 8: Connection performance.

### Table 4: Size 8 8 or 6 6, 8-connectivity, Nit = 3, N = 4 NitGibbs = 12

"... In PAGE 36: ... For 3 or more labels, DPA is still better than Gibbs, but farther from optimal. For higher-order cliques ( Table4 ), DPA degrades faster than Gibbs. We have also applied on larger graphs a search by dynamic programming with pruning of the current hypotheses, thus implementing a variation of the Viterbi algorithm.... ..."

### TABLE VIII. PATH LOCATION OPTIMIZATION RESULTS

2004

Cited by 4

### TABLE I FREQUENCY OF FINDING MORE OPTIMAL PATH

2003

Cited by 1

### 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.... ..."