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 ...
An alternative way of averaging the quantities is by a xed time interval, T. This ensures that any source sending at a rate greater than (one cell/T) will be encountered in the averaging interval. This interval is independent of the number of sources, but is dependent upon the minimum rate of the source. In addition to this, if the aggregate input rate is low, the xed-time interval is smaller than the xed-cells interval. However, when there is an overload, the xed-cells interval provides faster response. One way of combining these two kinds of intervals is to use the minimum of the xed-cell interval and the xed-time interval. This combination ensures quick response for both overload and underload conditions. But it still su ers from the disadvantages of a xed-cell interval, where N and per-VC CCR cannot be measured accurately [62]. Another strategy for overcoming this limitation is to measure N and per-VC CCR over a xed-time interval, and the capacity and load factor over the minimum of the xed-cell and xed-time interval. The time intervals can be di erent as long as some correlation exists between the quantities measured over the di erent intervals. Typically, the intervals to measure CCR and N would be larger to get more stable estimates. 6.13 Selection of ERICA Parameters Most congestion control schemes provide the network administrator with a number of parameters that can be set to adapt the behavior of the schemes to their needs. A good scheme must provide a small number of parameters that o er the desired 169
level of control. These parameters should be relatively insensitive to minor changes in network characteristics. ERICA provides a few parameters which are easy to set because the tradeo s between their values are well understood. Our simulation results have shown that slight mistuning of parameters does not signi cantly degrade the performance of the scheme. Two parameters are provided: the target Utilization (U) and the switch measurement interval. 6.13.1 Target Utilization U The target utilization determines the link utilization during steady state condi- tions. If the input rate is greater than Target Utilization Link Capacity, then the switch asks sources to decrease their rates to bring the total input rate to the de- sired fraction. If queues are present in the switch due to transient overloads, then (1 ; U) Link Capacity is used to drain the queues. Excessively high values of target utilization are undesirable because they lead to long queues and packet loss, while low target utilization values lead to link underuti- lization. The e ectiveness of the value of target utilization depends on the feedback delay of the network. Transient overloads can potentially result in longer queues for networks with longer feedback delays. Due to this, smaller target utilization values are more desirable for networks with long propagation delays. Our simulation results have determined that ideal values of target utilization are 0.95 and 0.9 for LANs and WANs respectively. Smaller values improve the perfor- mance of the scheme when the tra c is expected to be highly bursty. 170
- Page 145 and 146: Transmitted Cell Rate ABR Queue Len
- Page 147 and 148: 4. The RM cell contains a timestamp
- 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: of arithmetic averaging used above.
- 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 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
level of control. These parameters should be relatively <strong>in</strong>sensitive to m<strong>in</strong>or changes<br />
<strong>in</strong> network characteristics.<br />
ERICA provides a few parameters which are easy to set because <strong>the</strong> tradeo s<br />
between <strong>the</strong>ir values are well understood. Our simulation results have shown that<br />
slight mistun<strong>in</strong>g of parameters does not signi cantly degrade <strong>the</strong> per<strong>for</strong>mance of <strong>the</strong><br />
scheme. Two parameters are provided: <strong>the</strong> target Utilization (U) and <strong>the</strong> switch<br />
measurement <strong>in</strong>terval.<br />
6.13.1 Target Utilization U<br />
The target utilization determ<strong>in</strong>es <strong>the</strong> l<strong>in</strong>k utilization dur<strong>in</strong>g steady state condi-<br />
tions. If <strong>the</strong> <strong>in</strong>put rate is greater than Target Utilization L<strong>in</strong>k Capacity, <strong>the</strong>n <strong>the</strong><br />
switch asks sources to decrease <strong>the</strong>ir rates to br<strong>in</strong>g <strong>the</strong> total <strong>in</strong>put rate to <strong>the</strong> de-<br />
sired fraction. If queues are present <strong>in</strong> <strong>the</strong> switch due to transient overloads, <strong>the</strong>n<br />
(1 ; U) L<strong>in</strong>k Capacity is used to dra<strong>in</strong> <strong>the</strong> queues.<br />
Excessively high values of target utilization are undesirable because <strong>the</strong>y lead to<br />
long queues and packet loss, while low target utilization values lead to l<strong>in</strong>k underuti-<br />
lization. The e ectiveness of <strong>the</strong> value of target utilization depends on <strong>the</strong> feedback<br />
delay of <strong>the</strong> network. Transient overloads can potentially result <strong>in</strong> longer queues <strong>for</strong><br />
networks with longer feedback delays. Due to this, smaller target utilization values<br />
are more desirable <strong>for</strong> networks with long propagation delays.<br />
Our simulation results have determ<strong>in</strong>ed that ideal values of target utilization are<br />
0.95 and 0.9 <strong>for</strong> LANs and WANs respectively. Smaller values improve <strong>the</strong> per<strong>for</strong>-<br />
mance of <strong>the</strong> scheme when <strong>the</strong> tra c is expected to be highly bursty.<br />
170