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 ...
Figure 6.5: Hysteresis functions for ERICA+ required when the queues grow. We choose the former which is the simpler of the two. Since the portion T Q0
and Figure 6.6: The queue control function in ERICA+ f(Tq) = b Q0 (b ; 1) q + Q0 for 0 q Q0 Note that f(Tq) is a number between 1 and 0 in the range Q0 to in nity and between b and 1 in the range 0 to Q0. Both curves intersect at Q0, where the value is 1. These are simple rectangular hyperbolas which assume a value 1 at Q0. This function is lower bounded by the queue drain limit factor (QDLF): f(Tq) =Max(QDLF� 6.20 E ect of Variation on ERICA+ a Q0 ) forq > Q0 (a ; 1) q + Q0 ERICA+ calculates the target ABR capacity, which is the product of f(Tq) and the ABR capacity. Both these quantities are variant quantities (random variables), and the product of two random variables (say, A and B) results in a random variable which has more variance than either A or B. Feedback becomes less reliable as the variance increases. 180
- 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 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: Figure 6.4: Linear functions for ER
- 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
- 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
Figure 6.5: Hysteresis functions <strong>for</strong> ERICA+<br />
required when <strong>the</strong> queues grow. We choose <strong>the</strong> <strong>for</strong>mer which is <strong>the</strong> simpler of <strong>the</strong><br />
two.<br />
S<strong>in</strong>ce <strong>the</strong> portion T Q0
Change language