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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

The key question <strong>in</strong> simulat<strong>in</strong>g <strong>the</strong> tra<strong>in</strong> workload is what happens when <strong>the</strong><br />

adapter queue is full? Does <strong>the</strong> source keep putt<strong>in</strong>g more bursts <strong>in</strong>to <strong>the</strong> queue or<br />

stops putt<strong>in</strong>g new bursts until permitted. We resolve this question by classify<strong>in</strong>g <strong>the</strong><br />

application as cont<strong>in</strong>uous media (video, etc) or <strong>in</strong>terruptible media (data les). In a<br />

real system, cont<strong>in</strong>uous media cannot be <strong>in</strong>terrupted and <strong>the</strong> cells will be dropped<br />

by <strong>the</strong> adapter when <strong>the</strong> network permitted rate is low. With <strong>in</strong>terruptible media,<br />

<strong>the</strong> host stops generat<strong>in</strong>g new PDUs until permitted to do so by <strong>the</strong> adapter. We are<br />

simulat<strong>in</strong>g only <strong>in</strong>terruptible packet tra<strong>in</strong>s <strong>for</strong> <strong>ABR</strong> tra c.<br />

For <strong>in</strong>terruptible packet tra<strong>in</strong>s, <strong>the</strong> <strong>in</strong>tertra<strong>in</strong> gap is governed by a statistical<br />

distribution such as exponential. We use a constant <strong>in</strong>terval so that we can clearly<br />

see <strong>the</strong> e ect of <strong>the</strong> <strong>in</strong>terval. In particular, we use one-third duty cycle, that is, <strong>the</strong><br />

time taken to transmit <strong>the</strong> burst at <strong>the</strong> l<strong>in</strong>k rate is one-third of <strong>the</strong> <strong>in</strong>ter-burst time.<br />

In this case, unless <strong>the</strong>re are three or more VCs, <strong>the</strong> sources can not saturate <strong>the</strong> l<strong>in</strong>k<br />

and <strong>in</strong>terest<strong>in</strong>g e ects are seen with some schemes. In real networks, <strong>the</strong> duty-cycle is<br />

very small of <strong>the</strong> order of 0.01� <strong>the</strong> <strong>in</strong>ter-burst time may be of <strong>the</strong> order of m<strong>in</strong>utes and<br />

<strong>the</strong> burst transmission time is generally a fraction of a second. To simulate overloads<br />

with such sources would require hundreds of VCs. That is why we selected a duty<br />

cycle of 1/3. This allows us to study both underload and overload with a reasonable<br />

number of VCs. We used a burst of 50 cells to keep <strong>the</strong> simulation times reasonable.<br />

Figures 5.22 and 5.23 show simulation results <strong>for</strong> <strong>the</strong> transient and <strong>the</strong> upstream<br />

bottleneck con gurations us<strong>in</strong>g <strong>the</strong> packet tra<strong>in</strong> model.<br />

135

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

Saved successfully!

Ooh no, something went wrong!