**Next:**
Comparison of Switch Schemes**Up:**
Simulation Results**Previous:**
Source Bottleneck: Results

MCR value of zero was used for all sources. The figure
8 (a)-(d) show the ACRs of each type of VCs A through H for algorithms A, B, C and D respectively. The graphs show that the expected allocation as given in the table
2is achieved by all the algorithms. Algorithm B and D have rate oscillations due to queue control. The maximum queue occurred at switch SW6 around 500 ms for all algorithms. The value of the maximum queue was 39000, 30000, 340000 and 34000 cells for algorithms A, B, C and D respectively. Algorithm C does not have any queue control. Algorithm C had a huge queue because the maximum allocation for A type VC which has large round trip time was assigned for seven VCs of type G which have small round trip time. The input rate at the link between SW6 and SW7 is overloaded by a factor of seven which gives rise to the huge queues.

**Table 2:
**GFC-2 configuration: Expected allocations
VC |
A |
B |
C |
D |
E |
F |
G |
H |

Expected allocation |
10 |
5 |
35 |
35 |
35 |
10 |
5 |
52.5 |

**Next:**
Comparison of Switch Schemes**Up:**
Simulation Results**Previous:**
Source Bottleneck: Results
*Bobby Vandalore*

*1998-07-22*