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 ...
the source can pick any initial rate and start transmitting. It can use the averaging interval returned in the feedback to measure OCR, and at the end of the averaging interval send a control cell containing this OCR. When the control cell returns, it will have the information to change to the correct load level. Since the averaging intervals depend upon the path, averaging interval may be known to the source host from other VCs going to the same destination host. Also, a network manager may hardcode the same averaging interval in all switches and hosts. We do not recommend this procedure since not all switches that a host may eventually use may bein the control of the network manager. The initial transmission cell rate a ects the network operation for only the rst few (one or two) round trips. Therefore, it can be any value below (and including) the target cell rate of the link at the source. However, network managers may set any other initial rate to avoid startup impulses. 5.2 Key Features and Contributions of the OSU scheme The OSU scheme was presented to the ATM Forum tra c management working group in its September and October 1994 meetings. It highlighted several new ideas that have now become common features of most such schemes developed since then. This includes applying the concept of congestion avoidance to rate-based algorithms and the use of input rate instead of queue length for congestion detection. The number of parameters is small and their e ects are well understood. 5.2.1 Congestion Avoidance The OSU scheme is a congestion avoidance scheme. As de ned in [42], a congestion avoidance scheme is one that keeps the network at high throughput and low delay in 105
the steady state. The system operates at the knee of the throughput delay-curve as shown in Figure 3.1. The OSU scheme keeps the steady state bottleneck link utilization in the target utilization band (TUB). The utilization is high and the oscillations are bounded by the TUB. Hence, in spite of oscillations in the TUB, the load on the switch is always less than one. So the switch queues are close to zero resulting in minimum delay to sources. The target utilization and target utilzation band per-link parameters are set by the network manager based on the cost of the bandwidth, and the anticipated degree of variance in the network demand and capacity. The target utilization a ects the rate at which the queues are drained during overload. Ahighertarget utilization reduces unused capacity but increase the time to reach the e cient region after a disturbance. A lower target utilization may be necessary to cope with the e ects of variance in capacity and demand due to the introduction of errors introduced in measurement as a result of variance. A wide TUB results in a faster progress towards fairness. In most cases, a TUB of 90%(1 0.1) is a good choice. This gives a utilization in the range of 81% to 99%. 5.2.2 Parameters The OSU scheme requires just three parameters: the switch averaging interval (AI) , the target link utilization (U) , and the half-width of the target utilization band ( ). 106
- 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 and 128: Figure 5.3: Flow chart for updating
- Page 129 and 130: LAF in cell Max(LAF in cell, z) The
- Page 131: the time of departure (instant mark
- 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
- Page 179 and 180: (a) Regions used to prove Claim C1
- Page 181 and 182: 6.1 The Basic ERICA Algorithm The s
<strong>the</strong> steady state. The system operates at <strong>the</strong> knee of <strong>the</strong> throughput delay-curve as<br />
shown <strong>in</strong> Figure 3.1.<br />
The OSU scheme keeps <strong>the</strong> steady state bottleneck l<strong>in</strong>k utilization <strong>in</strong> <strong>the</strong> target<br />
utilization band (TUB). The utilization is high and <strong>the</strong> oscillations are bounded by<br />
<strong>the</strong> TUB. Hence, <strong>in</strong> spite of oscillations <strong>in</strong> <strong>the</strong> TUB, <strong>the</strong> load on <strong>the</strong> switch is always<br />
less than one. So <strong>the</strong> switch queues are close to zero result<strong>in</strong>g <strong>in</strong> m<strong>in</strong>imum delay to<br />
sources.<br />
The target utilization and target utilzation band per-l<strong>in</strong>k parameters are set by<br />
<strong>the</strong> network manager based on <strong>the</strong> cost of <strong>the</strong> bandwidth, and <strong>the</strong> anticipated degree<br />
of variance <strong>in</strong> <strong>the</strong> network demand and capacity. The target utilization a ects <strong>the</strong> rate<br />
at which <strong>the</strong> queues are dra<strong>in</strong>ed dur<strong>in</strong>g overload. Ahighertarget utilization reduces<br />
unused capacity but <strong>in</strong>crease <strong>the</strong> time to reach <strong>the</strong> e cient region after a disturbance.<br />
A lower target utilization may be necessary to cope with <strong>the</strong> e ects of variance <strong>in</strong><br />
capacity and demand due to <strong>the</strong> <strong>in</strong>troduction of errors <strong>in</strong>troduced <strong>in</strong> measurement<br />
as a result of variance. A wide TUB results <strong>in</strong> a faster progress towards fairness. In<br />
most cases, a TUB of 90%(1 0.1) is a good choice. This gives a utilization <strong>in</strong> <strong>the</strong><br />
range of 81% to 99%.<br />
5.2.2 Parameters<br />
The OSU scheme requires just three parameters: <strong>the</strong> switch averag<strong>in</strong>g <strong>in</strong>terval<br />
(AI) , <strong>the</strong> target l<strong>in</strong>k utilization (U) , and <strong>the</strong> half-width of <strong>the</strong> target utilization<br />
band ( ).<br />
106