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.

LAF <strong>in</strong> cell Max(LAF <strong>in</strong> cell, z)<br />

The idea is that if all sources divide <strong>the</strong>ir rates by LAF, <strong>the</strong> switch will have z =<br />

1 <strong>in</strong> <strong>the</strong> next cycle. In <strong>the</strong> presence of o<strong>the</strong>r bottlenecks, this algorithm converges to<br />

z = 1. In fact it reaches aband1 quickly. This band is identi ed as an e cient<br />

operat<strong>in</strong>g region. However, it does not ensure fair allocation of available bandwidth<br />

among contend<strong>in</strong>g sources. When z = 1, sources may have an unfair distribution of<br />

rates.<br />

Achiev<strong>in</strong>g Fairness<br />

Our rst goal is to achieve e cient operation. Once <strong>the</strong> network is operat<strong>in</strong>g close<br />

to <strong>the</strong> target utilization, we take steps to achieve fairness. The network manager<br />

declares a target utilization band (TUB), say, 90 9% or 81% to 99%. When <strong>the</strong> l<strong>in</strong>k<br />

utilization is <strong>in</strong> <strong>the</strong> TUB, <strong>the</strong> l<strong>in</strong>k is said to be operat<strong>in</strong>g e ciently. The TUB is<br />

hence<strong>for</strong>th expressed <strong>in</strong> <strong>the</strong> U(1 ) <strong>for</strong>mat, where U is <strong>the</strong> target utilization and<br />

is <strong>the</strong> half-width of <strong>the</strong> TUB. For example, 90 9% is expressed as 90(1 0:1)%.<br />

Equivalently, <strong>the</strong> TUB is identi ed when <strong>the</strong> current load level z lies <strong>in</strong> <strong>the</strong> <strong>in</strong>terval<br />

1 .<br />

We also need to count <strong>the</strong> number of active sources <strong>for</strong> our algorithm. The num-<br />

ber of active sources can be counted <strong>in</strong> <strong>the</strong> same averag<strong>in</strong>g <strong>in</strong>terval as that of load<br />

measurement. One simple method is to mark a bit <strong>in</strong> <strong>the</strong> VC table whenever a cell<br />

from a VC is seen. The bits are counted at <strong>the</strong> end of each averag<strong>in</strong>g <strong>in</strong>terval and<br />

are cleared at <strong>the</strong> beg<strong>in</strong>n<strong>in</strong>g of each <strong>in</strong>terval. Alternatively a count variable could be<br />

102

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

Saved successfully!

Ooh no, something went wrong!