24.11.2012 Views

Traffic Management for the Available Bit Rate (ABR) Service in ...

Traffic Management for the Available Bit Rate (ABR) Service in ...

Traffic Management for the Available Bit Rate (ABR) Service in ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

8 uses source rate measurement, we expect it to show better per<strong>for</strong>mance. This is<br />

substantiated by our simulation results presented later <strong>in</strong> <strong>the</strong> paper.<br />

9.4.4 E ect of L<strong>in</strong>k Congestion Control Actions<br />

In a network with non-VS/VD switches only, <strong>the</strong> bottleneck rate needs to reach<br />

<strong>the</strong> sources be<strong>for</strong>e any correspond<strong>in</strong>g load change is seen <strong>in</strong> <strong>the</strong> network. However,<br />

a VS/VD switch can en<strong>for</strong>ce <strong>the</strong> new bottleneck rate immediately (by chang<strong>in</strong>g <strong>the</strong><br />

ACR of <strong>the</strong> per-VC queue at <strong>the</strong> VS). This rate en<strong>for</strong>cement a ects <strong>the</strong> utilization of<br />

l<strong>in</strong>ks <strong>in</strong> <strong>the</strong> next loop. Hence, <strong>the</strong> VS/VD l<strong>in</strong>k congestion control actions can a ect<br />

neighbor<strong>in</strong>g loops. We have enumerated three options <strong>in</strong> an earlier section.<br />

We note that <strong>the</strong> second option (\next loop only") does not work because <strong>the</strong><br />

congestion <strong>in</strong><strong>for</strong>mation is not propagated to <strong>the</strong> sources of <strong>the</strong> congestion (as required<br />

by <strong>the</strong> standard [32]). This leaves us with two alternatives. The third option (\both<br />

loops") is attractive because, when ACR 2 is updated, <strong>the</strong> switches <strong>in</strong> <strong>the</strong> next loop<br />

experience <strong>the</strong> load change faster. Switch algorithms may save a few iterations and<br />

converge faster <strong>in</strong> <strong>the</strong>se cases.<br />

Figure 9.13 shows <strong>the</strong> fast convergence <strong>in</strong> a park<strong>in</strong>g lot con guration when such<br />

a VS/VD switch is used. The park<strong>in</strong>g lot con guration (Figure 9.13(c)) consists of<br />

three VCs contend<strong>in</strong>g <strong>for</strong> <strong>the</strong> Sw2-Sw3 l<strong>in</strong>k bandwidth. L<strong>in</strong>k lengths are 1000 km<br />

and l<strong>in</strong>k bandwidths are 155.52 Mbps. The target rate of <strong>the</strong> ERICA algorithm was<br />

90% of l<strong>in</strong>k bandwidth i.e., 139.97 Mbps. The round trip time <strong>for</strong> <strong>the</strong> S3-D3 VC is<br />

shorter than <strong>the</strong> round triptime<strong>for</strong><strong>the</strong> o<strong>the</strong>r two VCs. The optimum allocation by<br />

ERICA <strong>for</strong> each source is 1/3 of <strong>the</strong> target rate on <strong>the</strong> Sw2-Sw3 (about 46.7 Mbps).<br />

354

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!