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 ...
if the input rates are low and the queues are long, we recognize the need to reserve more capacity to drain the queues and allocate rates conservatively till the queues are controlled. Further, keeping in line with the design principles of ERICA, we use continuous functions of the queue length, rather than discontinuous functions. Since feedback to sources is likely to be regular (as long as queues remain), the allocations due to a continuous function in successive averaging intervals track the behavior of the queue and re ect it in the rate allocations. 6.15 ERICA+: 100% Utilization and Quick Drain of Queues ERICA achieves high utilization in the steady state, but utilization is limited by the target utilization parameter. For expensive links, it is desirable to keep the steady state utilization at 100%. This is because a link being able to service 5% more cells can translate into 5% more revenue. The way to get 100% utilization in steady state, and quick draining of queues is to vary the target ABR rate dynamically. During steady state, the target ABR rate is 100% while it is lower during transient overloads. Higher overloads result in even lower target rates (thereby draining the queues faster). In other words: Target rate = function (queue length, link rate, VBR rate) The \function" above has to be a decreasing function of the queue length. Note that ERICA has a xed target utilization, which means that the drain rate is independent of the queue size. 173
6.16 ERICA+: Maintain a \Pocket" of Queues The ABR capacityvaries dynamically, due to the presence of higher priorityclasses (CBR and VBR). Hence, if the higher priority classes are absent for a short interval (whichmay be smaller than the feedback delay), the remaining capacity is not utilized. In such situations, it is useful to have a \pocket" full of ABR cells which use the available capacity while the RM cells are taking the \good news" to the sources and asking them to increase their rates. One way toachieve this e ect is to control the queues to a \target queue length." In the steady state, the link is 100% utilized, and the queue length is equal to the target queue length, which is the \pocket" of queues we desire. If the queue length falls below this value, the sources are encouraged to increase their rate and vice versa. In other words: Target rate = function (queue length, target queue length, link rate, VBR rate) 6.17 ERICA+: Scalability to Various Link Speeds The above function is not scalable to various link speeds because the queue length measured in cells translates to di erent drain times for di erent transmission speeds. For example, a queue length of 5 at a T1 link may be considered large while a queue length of 50 at an OC-3 link may be considered small. This point is signi cant due to the varying nature of ABR capacity, especially in the presence of VBR sources. To achieve scalability, we need to measure all queue lengths in units of time rather than cells. However, the queue is the only directly measurable quantity at the switch. The queueing delay is then estimated using the measured ABR capacity value. The 174
- Page 149 and 150: 1. The source o ered average cell r
- Page 151 and 152: Transmitted Cell Rate Link Utilizat
- Page 153 and 154: Transmitted Cell Rate Link Utilizat
- Page 155 and 156: Transmitted Cell Rate Link Utilizat
- Page 157 and 158: Figure 5.17: The parking lot fairne
- Page 159 and 160: Figure 5.19: Network con guration w
- Page 161 and 162: Transmitted Cell Rate Link Utilizat
- Page 163 and 164: Transmitted Cell Rate Link Utilizat
- Page 165 and 166: 5.8 Proof: Fairness Algorithm Impro
- Page 167 and 168: Region 2: y s and x s and U(1 + ) x
- Page 169 and 170: eing divided into eight non-overlap
- Page 171 and 172: Proof for Region 2 Triangular regio
- Page 173 and 174: have: and y 0 = y(1 ; ) z x + y 0 =
- Page 175 and 176: The OSU scheme is, therefore, incom
- Page 177 and 178: workloads, where input load and cap
- Page 179 and 180: (a) Regions used to prove Claim C1
- Page 181 and 182: 6.1 The Basic ERICA Algorithm The s
- Page 183 and 184: A ow chart of the basic algorithm i
- Page 185 and 186: efore competing sources can receive
- Page 187 and 188: that the latest CCR information is
- Page 189 and 190: the CCR value may not be an accurat
- Page 191 and 192: (Target Utilization) (Link Bandwidt
- Page 193 and 194: ABR Capacity Input Rate Overload Fa
- Page 195 and 196: of arithmetic averaging used above.
- Page 197 and 198: level of control. These parameters
- Page 199: 6.14 ERICA+: Queue Length as a Seco
- Page 203 and 204: hence, introduces a new parameter,
- Page 205 and 206: Figure 6.4: Linear functions for ER
- Page 207 and 208: and Figure 6.6: The queue control f
- Page 209 and 210: small averaging intervals. If the a
- Page 211 and 212: The maximum value of T 0 also depen
- Page 213 and 214: 6.22 Performance Evaluation of the
- Page 215 and 216: espectively. The target delay T 0 i
- Page 217 and 218: 6.22.4 Fairness Figure 6.9: Parking
- Page 219 and 220: st link, VC 15 is limited to a thro
- Page 221 and 222: From the gures, it is clear that ER
- Page 223 and 224: counts the bursty source as active
- Page 225 and 226: 6.23 Summary of the ERICA and ERICA
- Page 227 and 228: (a) Transmitted Cell Rate (c) Link
- Page 229 and 230: (a) Transmitted Cell Rate (c) Link
- Page 231 and 232: (a) Transmitted Cell Rate (c) Link
- Page 233 and 234: (a) Transmitted Cell Rate (basic ER
- Page 235 and 236: (a) Transmitted Cell Rate (basic ER
- Page 237 and 238: (a) Transmitted Cell Rate (c) Link
- Page 239 and 240: (a) Transmitted Cell Rate (c) Link
- Page 241 and 242: (a) Transmitted Cell Rate (c) Link
- Page 243 and 244: (a) Transmitted Cell Rate (c) Link
- Page 245 and 246: (a) Transmitted Cell Rate (c) Link
- Page 247 and 248: (a) Transmitted Cell Rate (c) Link
- Page 249 and 250: (a) Transmitted Cell Rate (basic ER
6.16 ERICA+: Ma<strong>in</strong>ta<strong>in</strong> a \Pocket" of Queues<br />
The <strong>ABR</strong> capacityvaries dynamically, due to <strong>the</strong> presence of higher priorityclasses<br />
(CBR and VBR). Hence, if <strong>the</strong> higher priority classes are absent <strong>for</strong> a short <strong>in</strong>terval<br />
(whichmay be smaller than <strong>the</strong> feedback delay), <strong>the</strong> rema<strong>in</strong><strong>in</strong>g capacity is not utilized.<br />
In such situations, it is useful to have a \pocket" full of <strong>ABR</strong> cells which use <strong>the</strong><br />
available capacity while <strong>the</strong> RM cells are tak<strong>in</strong>g <strong>the</strong> \good news" to <strong>the</strong> sources and<br />
ask<strong>in</strong>g <strong>the</strong>m to <strong>in</strong>crease <strong>the</strong>ir rates.<br />
One way toachieve this e ect is to control <strong>the</strong> queues to a \target queue length."<br />
In <strong>the</strong> steady state, <strong>the</strong> l<strong>in</strong>k is 100% utilized, and <strong>the</strong> queue length is equal to <strong>the</strong><br />
target queue length, which is <strong>the</strong> \pocket" of queues we desire. If <strong>the</strong> queue length<br />
falls below this value, <strong>the</strong> sources are encouraged to <strong>in</strong>crease <strong>the</strong>ir rate and vice versa.<br />
In o<strong>the</strong>r words:<br />
Target rate = function (queue length, target queue length, l<strong>in</strong>k rate, VBR rate)<br />
6.17 ERICA+: Scalability to Various L<strong>in</strong>k Speeds<br />
The above function is not scalable to various l<strong>in</strong>k speeds because <strong>the</strong> queue length<br />
measured <strong>in</strong> cells translates to di erent dra<strong>in</strong> times <strong>for</strong> di erent transmission speeds.<br />
For example, a queue length of 5 at a T1 l<strong>in</strong>k may be considered large while a queue<br />
length of 50 at an OC-3 l<strong>in</strong>k may be considered small. This po<strong>in</strong>t is signi cant due<br />
to <strong>the</strong> vary<strong>in</strong>g nature of <strong>ABR</strong> capacity, especially <strong>in</strong> <strong>the</strong> presence of VBR sources.<br />
To achieve scalability, we need to measure all queue lengths <strong>in</strong> units of time ra<strong>the</strong>r<br />
than cells. However, <strong>the</strong> queue is <strong>the</strong> only directly measurable quantity at <strong>the</strong> switch.<br />
The queue<strong>in</strong>g delay is <strong>the</strong>n estimated us<strong>in</strong>g <strong>the</strong> measured <strong>ABR</strong> capacity value. The<br />
174