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.

When <strong>the</strong> source transmits data after an idle period, <strong>the</strong>re is no reliable feedback<br />

from <strong>the</strong> network. For one round trip time (time taken by a cell to travel from <strong>the</strong><br />

source to <strong>the</strong> dest<strong>in</strong>ation and back), <strong>the</strong> source rates are primarily controlled by <strong>the</strong><br />

<strong>ABR</strong> source end system rules (open-loop control). The open-loop control is replaced<br />

by <strong>the</strong> closed-loop control once <strong>the</strong> control loop is established. When <strong>the</strong> tra c on<br />

<strong>ABR</strong> is \bursty" i.e., <strong>the</strong> tra c consists of busy and idle periods, open-loop control<br />

may be exercised at <strong>the</strong> beg<strong>in</strong>n<strong>in</strong>g of every active period (burst). Hence, <strong>the</strong> source<br />

rules assume considerable importance <strong>in</strong> <strong>ABR</strong> ow control.<br />

8.3 Nature of TCP Tra c at <strong>the</strong> ATM Layer<br />

Data which uses TCP is controlled rst by <strong>the</strong>TCP\slow start" procedure be<strong>for</strong>e<br />

it appears as tra c to <strong>the</strong> ATM layer. Suppose wehave a large le transfer runn<strong>in</strong>g on<br />

top of TCP. When <strong>the</strong> le transfer beg<strong>in</strong>s, TCP sets its congestion w<strong>in</strong>dow (CWND)<br />

to one. The congestion w<strong>in</strong>dow <strong>in</strong>creases exponentially with time. Speci cally, <strong>the</strong><br />

w<strong>in</strong>dow <strong>in</strong>creases by one <strong>for</strong> every ack received. Over any round trip time (RTT), <strong>the</strong><br />

congestion w<strong>in</strong>dow doubles <strong>in</strong> size. From <strong>the</strong> switch's po<strong>in</strong>t of view, <strong>the</strong>re are two<br />

packets <strong>in</strong>put <strong>in</strong> <strong>the</strong> next cycle <strong>for</strong> every packet transmitted <strong>in</strong> <strong>the</strong> current cycle (a<br />

cycle at a bottleneck is de ned as <strong>the</strong> largest round trip time of any VC go<strong>in</strong>g through<br />

<strong>the</strong> bottleneck). In o<strong>the</strong>r words, <strong>the</strong> load (measured over a cycle) at most doubles<br />

every cycle. In o<strong>the</strong>r words, <strong>in</strong>itially, <strong>the</strong> TCP load <strong>in</strong>creases exponentially.<br />

Though <strong>the</strong> application on top of TCP is a persistant application ( le-transfer),<br />

as shown <strong>in</strong> Figure 8.3, <strong>the</strong> TCP tra c as seen at <strong>the</strong> ATM layer is bursty (i.e.,<br />

has active and idle periods). Initially, <strong>the</strong>re is a short active period (<strong>the</strong> rst packet<br />

is sent) followed by a long idle period (nearly one round-trip time, wait<strong>in</strong>g <strong>for</strong> an<br />

261

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

Saved successfully!

Ooh no, something went wrong!