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 ...
small over-allocation above 100% of ABR capacity is su cient for this purpose. The parameter a primarily determines how quickly the function f(Tq) drops as a function of queueing delay. a should not be very di erent from b because, this can result in widely di erent allocations when the delay slightly di ers from T 0. At the same time, a should be high enough control the queues quickly. Through simulation, we found that the values 1.15 and 1.05 for a and b respectively work well for all the workloads we have experimented with. Hence, at zero queues, we over-allocate up to 5% excess capacity to get the queues up to Q0. Higher values of b would allow sources to overload to a higher extent. This can aggravate transient overloads and result in higher queue spikes. Using a value of 1 for b is also acceptable, but the \pocket" of queues builds up very slowly in this case. A value of 1 for b is preferable when the variance is high. Further, these parameters values for a and b are relatively independent of T 0 or QDLF . Given these values for a and b, the function depends primarily on the choice of T 0andQDLF as discussed below. 6.21.2 Target Queueing Delay T 0 When the function f(Tq) is one of the two hyperbolas, its slope ( df ) is inversely dq proportional to the parameter T 0. For a constant value of a, larger T 0 reduces the slope of the function, and hence its e ectiveness. The queueing delay required to reduce the ABR capacity by a xed fraction is directly proportional to T 0. It is also directly proportional to the ABR capacity. Hence, if the ABR capacity is high (as is the case in OC-3 and higher speed networks), the queues need to build up to a large value before the drain capacity is su cient. Hence, the maximum value of T 0 depends upon and how fast the transient queues need to be cleared. 183
The maximum value of T 0 also depends on the bu er size at the switch, and must be set to allow the control of the queues before the bu er limit is reached. One strategy is to keep the bu er size at least the sum of the feedback delay and 8 T 0 (assuming a = 1.15 and QDLF = 0.5, and ABR capacity is constant, and other factors like measurement interval length are negligible). One feedback delay is enough for the feedback to reach the sources and 8 T 0 is enough for the function to reach QDLF . For other values of QDLF , the recommended bu er size is: (a ; QDLF ) T 0 [(a ; 1) QDLF ] The maximum value of T 0 can be calculated reversing the above formula, given the bu er size. T 0= [(a ; 1) QDLF ] (a ; QDLF ) A minimum value of T 0 is also desired for stable operation. If T 0 is very small, the function f(Tq) can traverse the range [QDLF� b] in a time (a;QDLF ) T 0 , assuming [(a;1) QDLF ] that capacity isconstant over this period of time. This time can be shorter than the feedback delay, and lead to undesired oscillations in rates and queues. This is because the function changes from b to QDLF before feedback is e ective. Such abehavior is undesired because, the scheme now is very sensitive to the changes in queue length. Recall that queue length is only a secondary metric, i.e., we want the input rate and not the queue length to be the primary metric of congestion. Further, the minimum T 0isat least the \pocket" of queues desired. For WANs, T 0 is at least [(a;1) QDLF ] (a;QDLF ) of the feedback delay, which is1/8, assuming a = 1.15, QDLF =0.5.For LANs, we set T 0 to at least one feedback delay, to reduce the sensitivity of the ABR capacity to small queue lengths. In cases of high variation and measurement errors, the \pocket" 184
- 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 and 200: 6.14 ERICA+: Queue Length as a Seco
- Page 201 and 202: 6.16 ERICA+: Maintain a \Pocket" of
- 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: small averaging intervals. If the a
- 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
- Page 251 and 252: RM cells. In this chapter, we devot
- Page 253 and 254: low. This tradeo was discovered and
- Page 255 and 256: in the speci cation. b) ACR shall n
- Page 257 and 258: 7.1.6 December 1995 Proposals There
- Page 259 and 260: Figure 7.2: Multiplicative vsAdditi
The maximum value of T 0 also depends on <strong>the</strong> bu er size at <strong>the</strong> switch, and<br />
must be set to allow <strong>the</strong> control of <strong>the</strong> queues be<strong>for</strong>e <strong>the</strong> bu er limit is reached.<br />
One strategy is to keep <strong>the</strong> bu er size at least <strong>the</strong> sum of <strong>the</strong> feedback delay and<br />
8 T 0 (assum<strong>in</strong>g a = 1.15 and QDLF = 0.5, and <strong>ABR</strong> capacity is constant, and<br />
o<strong>the</strong>r factors like measurement <strong>in</strong>terval length are negligible). One feedback delay is<br />
enough <strong>for</strong> <strong>the</strong> feedback to reach <strong>the</strong> sources and 8 T 0 is enough <strong>for</strong> <strong>the</strong> function<br />
to reach QDLF . For o<strong>the</strong>r values of QDLF , <strong>the</strong> recommended bu er size is:<br />
(a ; QDLF ) T 0<br />
[(a ; 1) QDLF ]<br />
The maximum value of T 0 can be calculated revers<strong>in</strong>g <strong>the</strong> above <strong>for</strong>mula, given <strong>the</strong><br />
bu er size.<br />
T 0=<br />
[(a ; 1) QDLF ]<br />
(a ; QDLF )<br />
A m<strong>in</strong>imum value of T 0 is also desired <strong>for</strong> stable operation. If T 0 is very small, <strong>the</strong><br />
function f(Tq) can traverse <strong>the</strong> range [QDLF� b] <strong>in</strong> a time<br />
(a;QDLF ) T 0<br />
, assum<strong>in</strong>g<br />
[(a;1) QDLF ]<br />
that capacity isconstant over this period of time. This time can be shorter than <strong>the</strong><br />
feedback delay, and lead to undesired oscillations <strong>in</strong> rates and queues. This is because<br />
<strong>the</strong> function changes from b to QDLF be<strong>for</strong>e feedback is e ective. Such abehavior is<br />
undesired because, <strong>the</strong> scheme now is very sensitive to <strong>the</strong> changes <strong>in</strong> queue length.<br />
Recall that queue length is only a secondary metric, i.e., we want <strong>the</strong> <strong>in</strong>put rate and<br />
not <strong>the</strong> queue length to be <strong>the</strong> primary metric of congestion. Fur<strong>the</strong>r, <strong>the</strong> m<strong>in</strong>imum<br />
T 0isat least <strong>the</strong> \pocket" of queues desired. For WANs, T 0 is at least<br />
[(a;1) QDLF ]<br />
(a;QDLF )<br />
of <strong>the</strong> feedback delay, which is1/8, assum<strong>in</strong>g a = 1.15, QDLF =0.5.For LANs, we<br />
set T 0 to at least one feedback delay, to reduce <strong>the</strong> sensitivity of <strong>the</strong> <strong>ABR</strong> capacity to<br />
small queue lengths. In cases of high variation and measurement errors, <strong>the</strong> \pocket"<br />
184