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 ...
5.2.5 Bipolar Feedback A network can provide two kinds of feedback to the sources. Positive feedback tells the sources to increase their load. Negative feedback tells the sources to decrease their load. These are called two polarities of the feedback. Some schemes are bipolar in the sense that they use both positive and negative feedback. The OSU scheme uses both polarities. The DECbit scheme [46] is another example of a bipolar scheme. Some schemes use only one polarity of feedback, say positive. Whenever, the sources receive the feedback, they increase the rate and when they don't receive any feedback, the network is assumed to be overloaded and the sources automatically decrease the rate without any explicit instruction from the network. Such schemes send feedback only when the network is underloaded and avoid sending feedback during overload. The PRCA scheme [26] is an example of a unipolar scheme with positive polarity only. Unipolar schemes with negative polarity are similarly possible. Early versions of PRCA used negative polarity in the sense that the sources increased the rate continuously unless instructed by tonetwork to decrease. The slow start scheme used in TCP/IP is also an example of unipolar scheme with negative polarity although in this case the feedback (packet loss) is an implicit feedback (no bits or control packets are sent to the source). The MIT scheme is unipolar with only negative feedback to the source. The switches can only reduce the rate and not increase it. For increase, the source has to send another control cell with a higher desired rate. Thus, increases are delayed resulting in reduced e ciency. 111
The key problem with some unipolar schemes is that the load is changed contin- uously { often on every cell. This may not be desirable for some workloads, such as compressed video tra c. Every adjustment in rate requires the application to adjust its parameters. Bipolar schemes can avoid the unnecessary adjustments by providing explicit instructions to the sources only when a load change is required. One reason for prefering unipolar feedback in some cases is that the number of feedback messages is reduced. However, this is not always true. For example, the MIT and OSU schemes have the same data cell to control cells ratio. In the MIT scheme, a second control cell has to be sent to determine the increase amount during underload. This is avoided in the OSU scheme by using a bipolar feedback. Since current ATM speci cations allow the switches to increase or decrease the rate of a source, all ATM switch implementations are expected to be bipolar. 5.2.6 Count the Number of Active Sources The OSU scheme introduced the concept of averaging interval and active sources. Most of the virtual circuits (VCs) in an ATM network are generally idle. Its the number of active VCs rather than the total number of VCs that is meaningful. We compute use the number of active VCs to compute fairshare. As discussed in section 5.10, if the measured value is wrong (which is possible if the averaging interval is short), fairness may bea ected. Other schemes like EPRCA attempt to achieve fairness without measuring the number of active sources. The technique they use is to advertise a single rate to all sources and parametrically increase or decrease the advertized rate. 112
- Page 87 and 88: networks like ATM can have complete
- Page 89 and 90: scheme followed by a discussion of
- Page 91 and 92: exibility of decoupling the enforce
- Page 93 and 94: 4.6.1 Key Techniques In EPRCA, the
- Page 95 and 96: If the mean ACR is not a good estim
- Page 97 and 98: is the ratio of the input rate to t
- Page 99 and 100: which shares the link equally as al
- Page 101 and 102: proportional to the the unused ABR
- Page 103 and 104: The key technique in the scheme is
- Page 105 and 106: the bandwidth allocations to satis
- Page 107 and 108: 4.10 DMRCA scheme The Dynamic Max R
- Page 109 and 110: on its CCR. Further MAX times out i
- Page 111 and 112: other words, a di erent set of para
- Page 113 and 114: A combination of several ideas in a
- Page 115 and 116: 4.13 SP-EPRCA scheme The SP-EPRCA s
- Page 117 and 118: RTD and shuts o the source (for sta
- Page 119 and 120: 4.14.1 Common Drawbacks Though the
- Page 121 and 122: The ATM Tra c Management standard a
- Page 123 and 124: 5.1.1 Control-Cell Format The contr
- Page 125 and 126: The last two elds are used in the b
- Page 127 and 128: Figure 5.3: Flow chart for updating
- Page 129 and 130: LAF in cell Max(LAF in cell, z) The
- Page 131 and 132: the time of departure (instant mark
- Page 133 and 134: the steady state. The system operat
- Page 135 and 136: 5.2.3 Use Measured Rather Than Decl
- Page 137: said about the maximum queue length
- Page 141 and 142: Figure 5.6: Space time diagram show
- Page 143 and 144: As noted, these heuristics do not g
- 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
5.2.5 Bipolar Feedback<br />
A network can provide two k<strong>in</strong>ds of feedback to <strong>the</strong> sources. Positive feedback<br />
tells <strong>the</strong> sources to <strong>in</strong>crease <strong>the</strong>ir load. Negative feedback tells <strong>the</strong> sources to decrease<br />
<strong>the</strong>ir load. These are called two polarities of <strong>the</strong> feedback. Some schemes are bipolar<br />
<strong>in</strong> <strong>the</strong> sense that <strong>the</strong>y use both positive and negative feedback. The OSU scheme uses<br />
both polarities. The DECbit scheme [46] is ano<strong>the</strong>r example of a bipolar scheme.<br />
Some schemes use only one polarity of feedback, say positive. Whenever, <strong>the</strong><br />
sources receive <strong>the</strong> feedback, <strong>the</strong>y <strong>in</strong>crease <strong>the</strong> rate and when <strong>the</strong>y don't receive any<br />
feedback, <strong>the</strong> network is assumed to be overloaded and <strong>the</strong> sources automatically<br />
decrease <strong>the</strong> rate without any explicit <strong>in</strong>struction from <strong>the</strong> network. Such schemes<br />
send feedback only when <strong>the</strong> network is underloaded and avoid send<strong>in</strong>g feedback<br />
dur<strong>in</strong>g overload. The PRCA scheme [26] is an example of a unipolar scheme with<br />
positive polarity only.<br />
Unipolar schemes with negative polarity are similarly possible. Early versions<br />
of PRCA used negative polarity <strong>in</strong> <strong>the</strong> sense that <strong>the</strong> sources <strong>in</strong>creased <strong>the</strong> rate<br />
cont<strong>in</strong>uously unless <strong>in</strong>structed by tonetwork to decrease. The slow start scheme used<br />
<strong>in</strong> TCP/IP is also an example of unipolar scheme with negative polarity although <strong>in</strong><br />
this case <strong>the</strong> feedback (packet loss) is an implicit feedback (no bits or control packets<br />
are sent to <strong>the</strong> source).<br />
The MIT scheme is unipolar with only negative feedback to <strong>the</strong> source. The<br />
switches can only reduce <strong>the</strong> rate and not <strong>in</strong>crease it. For <strong>in</strong>crease, <strong>the</strong> source has<br />
to send ano<strong>the</strong>r control cell with a higher desired rate. Thus, <strong>in</strong>creases are delayed<br />
result<strong>in</strong>g <strong>in</strong> reduced e ciency.<br />
111