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 ...
However, certain problems need to be solved before this idea can be used e ec- tively. First, the maximum VC rate oscillates excessively leading to transient instabil- ities in the behavior. This problem can be tackled by smoothing the maximum rate, ltering out the short-term variations. Second, in some situations, the maximum rate does not converge rapidly to the fairshare, again compromising fair behavior. The authors address this by using a reduction factor which is a function of the degree of congestion in the switch. DMRCA uses two thresholds QT and DQT on the queue length for congestion detection. The switch also monitors the maximum rate MAX of all connections arriving at the switch, as well as the VC number of the corresponding connection, MAX VC. The algorithm smoothes excessive oscillations in MAX using exponential averag- ing to calculate an adjusted maximum rate, as: A MAX =(1; Alpha) A MAX + Alpha MAX The averaging factor, Alpha is typically 1/16. The implementation is as follows: if( RMCell; >CCR Beta MAX) f A MAX =(1; Alpha) A MAX + Alpha RMCell; >CCR g This implementation avoids the need for measurement of MAX over a measure- ment interval. MAX increases when some VC other than MAX VC observes that its rate is larger than MAX. MAX decreases when MAX VC updates MAX based 81
on its CCR. Further MAX times out if it is not updated for a while (as in the case of bursty sources where some sources can become idle and start up with old allocations). When the queue length exceeds the threshold QT , the switch considers itself congested and performs intelligent marking. The threshold used to perform intelligent marking is: Marking Threshold = A MAX Fn(QueueLength) where Function(Queue Length) is a discrete non-increasing function of the queue length. The work also addresses how to tackle the case of connections with MCR > 0. For example, the fairness criterion \MCR plus Equal Share" is implemented by subtracting the MCR of the corresponding connection for the CCR of each RM cell and using the result as the algorithm. MCR is added back in order to set the ER eld in RM cells. The fairness criterion \Maximum of MCR or Max-Min Share" is implemented by simply ignoring the forward RM cells whose CCR is equal to their MCR. 4.10.2 Discussion The contributions of the scheme are: An enhanced EPRCA-like approach with better fairness and control of rate oscillations. Low implementation complexity. A chip implementation of the algorithm is available (the \Atlanta" chip of Lucent Technologies [76]. The use of a single advertised rate threshold value for all VCs results in nearly equal allocations to unconstrained VCs, even in the presence of asynchrony. 82
- Page 57 and 58: NI CI Action 0 0 ACR Min(ER, ACR +
- Page 59 and 60: Source Rule 13: Sources can optiona
- Page 61 and 62: Switch Rule 1: This rule speci es t
- Page 63 and 64: Observe that the ABR tra c manageme
- Page 65 and 66: complex method like per-VC queuing
- Page 67 and 68: graphs have a steady state with con
- Page 69 and 70: Figure 3.2: Operating point between
- Page 71 and 72: The following example illustrates t
- Page 73 and 74: mention this concept of fairness fo
- Page 75 and 76: control problem was also simpler. S
- 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: 4.10 DMRCA scheme The Dynamic Max R
- 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 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
However, certa<strong>in</strong> problems need to be solved be<strong>for</strong>e this idea can be used e ec-<br />
tively. First, <strong>the</strong> maximum VC rate oscillates excessively lead<strong>in</strong>g to transient <strong>in</strong>stabil-<br />
ities <strong>in</strong> <strong>the</strong> behavior. This problem can be tackled by smooth<strong>in</strong>g <strong>the</strong> maximum rate,<br />
lter<strong>in</strong>g out <strong>the</strong> short-term variations. Second, <strong>in</strong> some situations, <strong>the</strong> maximum rate<br />
does not converge rapidly to <strong>the</strong> fairshare, aga<strong>in</strong> compromis<strong>in</strong>g fair behavior. The<br />
authors address this by us<strong>in</strong>g a reduction factor which is a function of <strong>the</strong> degree of<br />
congestion <strong>in</strong> <strong>the</strong> switch.<br />
DMRCA uses two thresholds QT and DQT on <strong>the</strong> queue length <strong>for</strong> congestion<br />
detection. The switch also monitors <strong>the</strong> maximum rate MAX of all connections<br />
arriv<strong>in</strong>g at <strong>the</strong> switch, as well as <strong>the</strong> VC number of <strong>the</strong> correspond<strong>in</strong>g connection,<br />
MAX VC.<br />
The algorithm smoo<strong>the</strong>s excessive oscillations <strong>in</strong> MAX us<strong>in</strong>g exponential averag-<br />
<strong>in</strong>g to calculate an adjusted maximum rate, as:<br />
A MAX =(1; Alpha) A MAX + Alpha MAX<br />
The averag<strong>in</strong>g factor, Alpha is typically 1/16. The implementation is as follows:<br />
if( RMCell; >CCR Beta MAX) f<br />
A MAX =(1; Alpha) A MAX + Alpha RMCell; >CCR<br />
g<br />
This implementation avoids <strong>the</strong> need <strong>for</strong> measurement of MAX over a measure-<br />
ment <strong>in</strong>terval. MAX <strong>in</strong>creases when some VC o<strong>the</strong>r than MAX VC observes that<br />
its rate is larger than MAX. MAX decreases when MAX VC updates MAX based<br />
81