### Table 2: Experiment Result of MaxFlow

2004

"... In PAGE 4: ...odes. They have the same demand as 100. The unicast path be- tween any pair of nodes with each session is determined by shortest- path routing. Table2 shows the result of MaxFlow with different approxima- tion ratios. The overall throughput is the aggregate receiving rate of all session members, i.... In PAGE 6: ... The overhead of this extra step is reflected in the second part. From the data in Table 4, we have the same observation as from Table2 , except that the rate of session 2 is increased, at the price of dragging down the rate of session 1. The overall throughput also drops for the same reason.... ..."

Cited by 6

### Table 2: Experiment Result of MaxFlow

2004

"... In PAGE 4: ...odes. They have the same demand as 100. The unicast path be- tween any pair of nodes with each session is determined by shortest- path routing. Table2 shows the result of MaxFlow with different approxima- tion ratios. The overall throughput is the aggregate receiving rate of all session members, i.... In PAGE 6: ... The overhead of this extra step is reflected in the second part. From the data in Table 4, we have the same observation as from Table2 , except that the rate of session 2 is increased, at the price of dragging down the rate of session 1. The overall throughput also drops for the same reason.... ..."

Cited by 6

### TABLE VII EXPERIMENT RESULT OF MaxFlow WITH ARBITRARY ROUTING

2004

Cited by 6

### TABLE II COMPUTATIONAL COMPLEXITY OF THE WORST-CASE META-MAX FLOW PROBLEM FOR UP TO 3 HIERARCHICAL LEVELS

### TABLE II EXPERIMENT RESULT OF MaxFlow

2004

Cited by 6

### TABLE II ERROR DETECTION CAPABILITIES OF THE DISTRIBUTED MAX-FLOW IMPLEMENTATION.

2005

Cited by 2

### Table 2 Number of Times that Max-Flow is Executed in c = 1 and c = 2 passes in CutMap

1995

"... In PAGE 5: ... We evaluate the impact of applying Theorem 3 in the optimal min-cost K-feasible cut algorithm by reporting number of times that max-flow routine is executed in c = 1 and c = 2 passes. Table2... ..."

Cited by 38

### Table 2 Number of Times that Max-Flow is Executed in c = 1 and c = 2 passes in CutMap

1995

"... In PAGE 5: ... We evaluate the impact of applying Theorem 3 in the optimal min-cost K-feasible cut algorithm by reporting number of times that max-flow routine is executed in c = 1 and c = 2 passes. Table2... ..."

Cited by 38

### Table 2 Number of Times that Max-Flow is Executed in c = 1 and c = 2 passes in CutMap

"... In PAGE 5: ... We evaluate the impact of applying Theorem 3 in the optimal min-cost K-feasible cut algorithm by reporting number of times that max-flow routine is executed in c = 1 and c = 2 passes. Table2... ..."