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.

But <strong>the</strong> development of feedback mechanisms has led to an expansion of <strong>the</strong>se goals.<br />

Speci cally, switches can give feedback such that <strong>the</strong> sources are treated <strong>in</strong> a \fair"<br />

manner. Fur<strong>the</strong>r, switches can control <strong>the</strong> queu<strong>in</strong>g delays, provide a comb<strong>in</strong>ation of<br />

quick response time, and a stable steady state. Switches today can also compensate<br />

e ciently <strong>for</strong> errors due to variation <strong>in</strong> network load and capacity. In this section, we<br />

will make <strong>the</strong>se goals more concrete, and use <strong>the</strong>se goals as a reference to evaluate<br />

switch schemes.<br />

3.2.1 Congestion Avoidance<br />

The goal of congestion avoidance is to br<strong>in</strong>g <strong>the</strong> network to an operat<strong>in</strong>g po<strong>in</strong>t<br />

of high throughput and low delay [46]. Typically, <strong>the</strong>re is a tradeo between <strong>the</strong><br />

l<strong>in</strong>k utilization and <strong>the</strong> switch queu<strong>in</strong>g delay. For low utilization, <strong>the</strong> switch queue is<br />

small, and <strong>the</strong> delay is small. Once utilization is very high, <strong>the</strong> queues grow. F<strong>in</strong>ally,<br />

when <strong>the</strong> queue size exceeds <strong>the</strong> available bu er size, cells are dropped. In this state,<br />

though <strong>the</strong> l<strong>in</strong>k utilization may be high (s<strong>in</strong>ce <strong>the</strong> queue length is greater than zero),<br />

<strong>the</strong> e ective end-to-end throughput is low (s<strong>in</strong>ce several packets do not reach <strong>the</strong><br />

dest<strong>in</strong>ation). In general, we may replace <strong>the</strong> terms \utilization" and \switch queu<strong>in</strong>g<br />

delay" can be replaced by \throughput" and \end-to-end delay" respectively when<br />

we consider entire networks.<br />

Figure 3.1 shows <strong>the</strong> throughput and delay with vary<strong>in</strong>g load <strong>in</strong> <strong>the</strong> network. The<br />

operat<strong>in</strong>g po<strong>in</strong>twhich has a utilization close to 100% and moderate delays is called <strong>the</strong><br />

knee of <strong>the</strong> delay-throughput curve. Formally, <strong>the</strong> knee is <strong>the</strong> po<strong>in</strong>t where <strong>the</strong> ratio of<br />

<strong>the</strong> bottleneck throughput to bottleneck response time (delay) as a function of <strong>in</strong>put<br />

load is maximized. In a network which is <strong>in</strong> a ideal operat<strong>in</strong>g po<strong>in</strong>t, typical utilization<br />

39

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

Saved successfully!

Ooh no, something went wrong!