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.

4.13 SP-EPRCA scheme<br />

The SP-EPRCA scheme [15] was developed by Cavendish, Mascolo and Gerla at<br />

<strong>the</strong> University of Cali<strong>for</strong>nia at Los Angeles.<br />

4.13.1 Key Techniques<br />

The key idea <strong>in</strong> SP-EPRCA is <strong>the</strong> use of a proportional controller with a Smith<br />

Predictor (SP) to compensate <strong>for</strong> <strong>the</strong> delay <strong>in</strong> <strong>the</strong> <strong>ABR</strong> feedback loop. E ectively,<br />

<strong>the</strong> dynamic control system with a delay <strong>in</strong> <strong>the</strong> feedback loop is converted <strong>in</strong>to a<br />

simple rst order dynamic system with a delay <strong>in</strong> cascade. S<strong>in</strong>ce, <strong>the</strong>oretically <strong>the</strong><br />

delay is brought out of <strong>the</strong> feedback loop, it does not a ect stability and<strong>the</strong> system<br />

should not have oscillations <strong>in</strong> <strong>the</strong> steady state.<br />

The scheme aims to keep <strong>the</strong> queue occupancy under some desired value while<br />

achiev<strong>in</strong>g a fair distribution of rates. In <strong>the</strong> steady state, <strong>the</strong> scheme aims <strong>for</strong> <strong>the</strong><br />

follow<strong>in</strong>g relation between <strong>the</strong> rate stationary rate us, and <strong>the</strong> stationary queue length<br />

xs ofaVC:<br />

us = X o ; xs<br />

1=K + RT D<br />

K is <strong>the</strong> ga<strong>in</strong> factor, a parameter of <strong>the</strong> Smith Predictor, X o is <strong>the</strong> target queue<br />

length, and RT D is <strong>the</strong> round trip delay.<br />

The scheme functions as follows. The switches send <strong>the</strong> available bu er space <strong>for</strong><br />

cell storage <strong>for</strong> that particular connection back to <strong>the</strong> source (<strong>in</strong> one version of <strong>the</strong><br />

scheme, <strong>the</strong> target queue length, X o , can be fed back <strong>in</strong>stead of us<strong>in</strong>g <strong>in</strong>dividual bu er<br />

allocations). Each source implements a Smith Predictor which requires <strong>the</strong> knowledge<br />

of <strong>the</strong> round trip delay and an estimate of <strong>the</strong> vary<strong>in</strong>g delay <strong>in</strong> <strong>the</strong> network.<br />

88

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

Saved successfully!

Ooh no, something went wrong!