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 ...
to achieve fairness. The measured value of the current load level is used to decide whether the e ciency or the fairness algorithm is used to calculate feedback. Measuring The Current Load z The switch measures its current load level, z , as the ratio of its \input rate" to its \target output rate". The input rate is measured by counting the number of cells received by the switch during a xed averaging interval. The target output rate is set to a fraction (close to 100 %) of the link rate. This fraction, called Target Utilization (U ), allows high utilization and low queues in steady state. The current load level z is used to detect congestion at the switch and determine an overload or underload condition. Target Output Cell Rate = z = Target Utilization (U) Link bandwidth in Mbps Cell size in bits Number of cells received during the averaging interval Target Output Cell Rate Averaging Interval The switches on the path have averaging intervals to measure their current load levels (z). These averaging intervals are set locally by network managers. A single value of z is assumed to correspond to one OCR value of every source. If two control cells of a source with di erent OCRs are seen in a single interval (for one value of z), the above assumption is violated and con icting feedbacks may be given to the source. So, when feedback is given to the sources the AI eld is set to the maximum of the AI eld in the cell and the switch averaging interval: Achieving E ciency AI in cell Max(AI in cell, switch averaging interval) E ciency is achieved as follows: 101
LAF in cell Max(LAF in cell, z) The idea is that if all sources divide their rates by LAF, the switch will have z = 1 in the next cycle. In the presence of other bottlenecks, this algorithm converges to z = 1. In fact it reaches aband1 quickly. This band is identi ed as an e cient operating region. However, it does not ensure fair allocation of available bandwidth among contending sources. When z = 1, sources may have an unfair distribution of rates. Achieving Fairness Our rst goal is to achieve e cient operation. Once the network is operating close to the target utilization, we take steps to achieve fairness. The network manager declares a target utilization band (TUB), say, 90 9% or 81% to 99%. When the link utilization is in the TUB, the link is said to be operating e ciently. The TUB is henceforth expressed in the U(1 ) format, where U is the target utilization and is the half-width of the TUB. For example, 90 9% is expressed as 90(1 0:1)%. Equivalently, the TUB is identi ed when the current load level z lies in the interval 1 . We also need to count the number of active sources for our algorithm. The num- ber of active sources can be counted in the same averaging interval as that of load measurement. One simple method is to mark a bit in the VC table whenever a cell from a VC is seen. The bits are counted at the end of each averaging interval and are cleared at the beginning of each interval. Alternatively a count variable could be 102
- Page 77 and 78: of such an occurrence is expected t
- Page 79 and 80: y giving only one feedback per meas
- Page 81 and 82: CHAPTER 4 SURVEY OF ATM SWITCH CONG
- Page 83 and 84: The adaptive FCVC algorithm [63] co
- Page 85 and 86: np. Thus, long path VCs have fewer
- 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: Figure 5.3: Flow chart for updating
- 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 and 138: said about the maximum queue length
- Page 139 and 140: The key problem with some unipolar
- 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
to achieve fairness. The measured value of <strong>the</strong> current load level is used to decide<br />
whe<strong>the</strong>r <strong>the</strong> e ciency or <strong>the</strong> fairness algorithm is used to calculate feedback.<br />
Measur<strong>in</strong>g The Current Load z<br />
The switch measures its current load level, z , as <strong>the</strong> ratio of its \<strong>in</strong>put rate" to<br />
its \target output rate". The <strong>in</strong>put rate is measured by count<strong>in</strong>g <strong>the</strong> number of cells<br />
received by <strong>the</strong> switch dur<strong>in</strong>g a xed averag<strong>in</strong>g <strong>in</strong>terval. The target output rate is set<br />
to a fraction (close to 100 %) of <strong>the</strong> l<strong>in</strong>k rate. This fraction, called Target Utilization<br />
(U ), allows high utilization and low queues <strong>in</strong> steady state. The current load level<br />
z is used to detect congestion at <strong>the</strong> switch and determ<strong>in</strong>e an overload or underload<br />
condition.<br />
Target Output Cell <strong>Rate</strong> =<br />
z =<br />
Target Utilization (U) L<strong>in</strong>k bandwidth <strong>in</strong> Mbps<br />
Cell size <strong>in</strong> bits<br />
Number of cells received dur<strong>in</strong>g <strong>the</strong> averag<strong>in</strong>g <strong>in</strong>terval<br />
Target Output Cell <strong>Rate</strong> Averag<strong>in</strong>g Interval<br />
The switches on <strong>the</strong> path have averag<strong>in</strong>g <strong>in</strong>tervals to measure <strong>the</strong>ir current load<br />
levels (z). These averag<strong>in</strong>g <strong>in</strong>tervals are set locally by network managers. A s<strong>in</strong>gle<br />
value of z is assumed to correspond to one OCR value of every source. If two control<br />
cells of a source with di erent OCRs are seen <strong>in</strong> a s<strong>in</strong>gle <strong>in</strong>terval (<strong>for</strong> one value of<br />
z), <strong>the</strong> above assumption is violated and con ict<strong>in</strong>g feedbacks may be given to <strong>the</strong><br />
source. So, when feedback is given to <strong>the</strong> sources <strong>the</strong> AI eld is set to <strong>the</strong> maximum<br />
of <strong>the</strong> AI eld <strong>in</strong> <strong>the</strong> cell and <strong>the</strong> switch averag<strong>in</strong>g <strong>in</strong>terval:<br />
Achiev<strong>in</strong>g E ciency<br />
AI <strong>in</strong> cell Max(AI <strong>in</strong> cell, switch averag<strong>in</strong>g <strong>in</strong>terval)<br />
E ciency is achieved as follows:<br />
101